Paper Info
Title
An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)
Abstract
Interior point methods for nonlinear programs (NLPs) are adapted for solution of mathematical programs with complementarity constraints (MPCCs). The constraints of the MPCC are suitably relaxed so as to guarantee a strictly feasible interior for the inequality constraints. The standard primal-dual algorithm has been adapted with a modified step calculation. The algorithm is shown to be superlinearly convergent in the neighborhood of the solution set under assumptions of MPCC-LICQ, strong stationarity and upper level strict complementarity. The modification can be easily accommodated within most nonlinear programming interior point algorithms with identical local behavior. Numerical experience is also presented and holds promise for the proposed method.
Year
DOI
Venue
2005
10.1137/S1052623403429081
SIAM Journal on Optimization
Keywords
Field
DocType
mathematical programs,nonlinear program,identical local behavior,strict complementarity,complementarity constraints,complementarity constraint,inequality constraint,interior point method,standard primal-dual algorithm,nonlinear programming interior point,feasible interior,mathematical program,complementarity,nonlinear programming,interior point methods
Complementarity (molecular biology),Mathematical optimization,Nonlinear system,Nonlinear programming,Complementarity theory,Solution set,Mixed complementarity problem,Interior point method,Mathematics
Journal
Volume
Issue
ISSN
15
3
1052-6234
Citations 
PageRank 
References 
27
1.40
12
Authors
2
Name
Order
Citations
PageRank
Arvind U. Raghunathan116320.63
Lorenz T. Biegler22271185.43