Complementarity: Applications, Algorithms and Extensions

2001. Auflage 2001
ISBN: 978-0-7923-6816-8
Verlag: Springer Us

Buch, Englisch, Band 50, 404 Seiten, Format (B × H): 156 mm x 234 mm, Gewicht: 1670 g

Reihe: Applied Optimization

This volume presents state-of-the-art complementarity applications, algorithms, extensions and theory in the form of eighteen papers. These at the International Conference on Com­ invited papers were presented plementarity 99 (ICCP99) held in Madison, Wisconsin during June 9-12, 1999 with support from the National Science Foundation under Grant DMS-9970102. Complementarity is becoming more widely used in a variety of appli­ cation areas. In this volume, there are papers studying the impact of complementarity in such diverse fields as deregulation of electricity mar­ kets, engineering mechanics, optimal control and asset pricing. Further­ more, application of complementarity and optimization ideas to related problems in the burgeoning fields of machine learning and data mining are also covered in a series of three articles. In order to effectively process the complementarity problems that arise in such applications, various algorithmic, theoretical and computational extensions are covered in this volume. Nonsmooth analysis has an im­ portant role to play in this area as can be seen from articles using these tools to develop Newton and path following methods for constrained nonlinear systems and complementarity problems. Convergence issues are covered in the context of active set methods, global algorithms for pseudomonotone variational inequalities, successive convex relaxation and proximal point algorithms. Theoretical contributions to the connectedness of solution sets and constraint qualifications in the growing area of mathematical programs with equilibrium constraints are also presented. A relaxation approach is given for solving such problems. Finally, computational issues related to preprocessing mixed complementarity problems are addressed.

Zielgruppe

Research

Autoren/Hrsg.

Ferris, Michael C

Mangasarian, Olvi L

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz
• Wirtschaftswissenschaften Betriebswirtschaft Management
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Mathematik | Informatik Mathematik Operations Research
• Mathematik | Informatik EDV | Informatik Informatik Theoretische Informatik
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle

Inhaltsverzeichnis

Approximating Maximum Stable Set and Minimum Graph Coloring Problems with the Positive Semidefinite Relaxation.- Nonmonotone Path Following Methods for Nonsmooth Equations and Complementarity Problems.- Scalable Probabilistic Clustering.- A complementarity eigenproblem in the stability analysis of finite dimensional elastic systems with frictional contact.- Variational Inequality Models of Restructured Electricity Systems.- Optimization Approaches to Semi-Supervised Learning.- Preprocessing Complementarity Problems.- On the Connectedness of Solution Sets of Parametrized Equations and of Solution Sets in Linear Complementarity Problems.- An Active Set-type Newton Method for Constrained Nonlinear Systems.- Mathematical Programming in Engineering Mechanics: Some Current Problems.- Data Discrimination via Nonlinear Generalized Support Vector Machines.- On Constraint Qualifications for Mathematical Programs with Mixed Complementarity Constraints.- A Generation Operation Planning Model in Deregulated Electricity Markets based on the Complementarity Problem.- A Class of Globally Convergent Algorithms for Pseudomonotone Variational Inequalities.- Successive Convex Relaxation Approach to Bilevel Quadratic Optimization Problems.- On a Nonsmooth Newton Method for Nonlinear Complementarity Problems in Function Space with Applications to Optimal Control.- The Proximal Point Algorithm for the P0 Complementarity Problem.- Free Boundary Problems in Asset Pricing with Transaction Costs.