Interior Methods for Mathematical Programs with Complementarity Constraints

This paper studies theoretical and practical properties of interior-penalty methods for mathematical programs with complementarity constraints. A framework for implementing these methods is presented, and the need for adaptive penalty update strategies is motivated with examples. The algorithm is shown to be globally convergent to strongly stationary points, under standard assumptions. These results are then extended to an interior-relaxation approach. Superlinear convergence to strongly stationary points is also established. Two strategies for updating the penalty parameter are proposed, and their efficiency and robustness are studied on an extensive collection of test problems.

[1]  Jorge Nocedal,et al.  On the Local Behavior of an Interior Point Method for Nonlinear Programming , 1997 .

[2]  Robert J. Vanderbei,et al.  An Interior-Point Algorithm for Nonconvex Nonlinear Programming , 1999, Comput. Optim. Appl..

[3]  Jorge Nocedal,et al.  An Interior Point Algorithm for Large-Scale Nonlinear Programming , 1999, SIAM J. Optim..

[4]  M. Ferris,et al.  On the solution of a minimum weight elastoplastic problem involving displacement and complementarity constraints , 1999 .

[5]  Stefan Scholtes,et al.  Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity , 2000, Math. Oper. Res..

[6]  Nicholas I. M. Gould,et al.  Trust Region Methods , 2000, MOS-SIAM Series on Optimization.

[7]  Stefan Scholtes,et al.  Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints , 2000, SIAM J. Optim..

[8]  M. Anitescu.  On Solving Mathematical Programs With Complementarity Constraints As Nonlinear Programs , 2002 .

[9]  Anders Forsgren,et al.  Interior Methods for Nonlinear Optimization , 2002, SIAM Rev..

[10]  Sven Leyffer,et al.  Nonlinear programming without a penalty function , 2002, Math. Program..

[11]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

[12]  Michael A. Saunders,et al.  SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization , 2002, SIAM J. Optim..

[13]  Stephen J. Wright,et al.  Some properties of regularization and penalization schemes for MPECs , 2004, Optim. Methods Softw..

[14]  D. Ralph,et al.  Convergence of a Penalty Method for Mathematical Programming with Complementarity Constraints , 2004 .

[15]  M. Friedlander,et al.  An interior-point method for mpecs based on strictly feasible relaxations , 2004 .

[16]  Jie Sun,et al.  Generalized stationary points and an interior-point method for mathematical programs with equilibrium constraints , 2004, Math. Program..

[17]  Sven Leyffer,et al.  Solving mathematical programs with complementarity constraints as nonlinear programs , 2004, Optim. Methods Softw..

[18]  Mihai Anitescu,et al.  Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints , 2005, SIAM J. Optim..

[19]  Michael P. Friedlander,et al.  A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints , 2005, SIAM J. Optim..

[20]  Lorenz T. Biegler,et al.  An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs) , 2005, SIAM J. Optim..

[21]  Donald Goldfarb,et al.  l2-PENALTY METHODS FOR NONLINEAR PROGRAMMING WITH STRONG GLOBAL CONVERGENCE PROPERTIES , 2004 .

[22]  Jorge Nocedal,et al.  An interior algorithm for nonlinear optimization that combines line search and trust region steps , 2006, Math. Program..

[23]  Sven Leyffer,et al.  Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints , 2006, SIAM J. Optim..

[24]  Robert J. Vanderbei,et al.  Interior-Point Algorithms, Penalty Methods and Equilibrium Problems , 2006, Comput. Optim. Appl..