On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems
Authors:
- 1 February 1998
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 23 (1) , 39-60
Abstract
Extending our previous work (Monteiro and Pang 1996), this paper studies properties of two fundamental mappings associated with the family of interior-point methods for solving monotone nonlinear complementarity problems over the cone of symmetric positive semidefinite matrices. The first of these maps lead to a family of new continuous trajectories which include the central trajectory as a special case. These trajectories completely “fill up” the set of interior feasible points of the problem in the same way as the weighted central paths do the interior of the feasible region of a linear program. Unlike the approach based on the theory of maximal monotone maps taken by Shida and Shindoh (1996) and Shida, Shindoh, and Kojima (1995), our approach is based on the theory of local homeomorphic maps in nonlinear analysis.Keywords
This publication has 12 references indexed in Scilit:
- Centers of Monotone Generalized Complementarity ProblemsMathematics of Operations Research, 1997
- Primal--Dual Path-Following Algorithms for Semidefinite ProgrammingSIAM Journal on Optimization, 1997
- Strong Duality for Semidefinite ProgrammingSIAM Journal on Optimization, 1997
- First and second order analysis of nonlinear semidefinite programsMathematical Programming, 1997
- Complementarity and nondegeneracy in semidefinite programmingMathematical Programming, 1997
- Self-Scaled Barriers and Interior-Point Methods for Convex ProgrammingMathematics of Operations Research, 1997
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric MatricesSIAM Journal on Optimization, 1997
- Properties of an Interior-Point Mapping for Mixed Complementarity ProblemsMathematics of Operations Research, 1996
- Semidefinite ProgrammingSIAM Review, 1996
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial OptimizationSIAM Journal on Optimization, 1995