On Solving Mathematical Programs With Complementarity Constraints As Nonlinear Programs

134 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Equilibria in an Oligopolistic Electricity Pool With Stepwise Offer Curves (2012, background): “Due to the recent improvement in standard nonlinear solvers and their successful application to MPECs [22], [5], [23], NCP techniques have become a viable alternative to the resolution of EPECs.”
Complementarity Formulations of ' 0 -norm Optimization Problems (2013, background): “Nevertheless, some NLP solvers have been found to be able to produce good numerical solutions for these reformulations [17].”
Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints (2006, methodology): “Anitescu [1] provides a framework for convergence (possibly under additional assumptions) of Sl∞QP methods.”
Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints (2003, methodology): “In [18] properties of MPECs have been derived guaranteeing a good behavior of elastic mode SQP algorithms.”
Complementarity constraints as nonlinear equations: Theory and numerical experience (2006, methodology): “Anitescu [1] establishes that an SQP method with elastic mode converges locally for MPCCs with (1.”