Interior point methods for nonlinear programs (NLPs) are adapted for solution of mathematical programs with complementarity constraints (MPCCs). The constraints of the …
A Fischer - Mathematical Programming, 2002 - Springer
An iterative framework for solving generalized equations with nonisolated solutions is presented. For generalized equations with the structure, where is a multifunction and F is …
M Anitescu - SIAM Journal on Optimization, 2000 - SIAM
We show that the quadratic growth condition and the Mangasarian--Fromovitz constraint qualification (MFCQ) imply that local minima of nonlinear programs are isolated stationary …
AF Izmailov, MV Solodov - Mathematical programming, 2012 - Springer
The stabilized version of the sequential quadratic programming algorithm (sSQP) had been developed in order to achieve superlinear convergence in situations when the Lagrange …
M Anitescu - Preprint ANL/MCS-P864-1200, Argonne National …, 2000 - mcs.anl.gov
We investigate the possibility of solving mathematical programs with complementarity constraints (MPCCs) using algorithms and procedures of smooth nonlinear programming …
SJ Wright - SIAM Journal on Optimization, 2005 - SIAM
This paper describes and analyzes an algorithmic framework for solving nonlinear programming problems in which strict complementarity conditions and constraint …
K Bai, JJ Ye, J Zhang - SIAM Journal on Optimization, 2019 - SIAM
In this paper we study sufficient conditions for metric subregularity of a set-valued map which is the sum of a single-valued continuous map and a locally closed subset. First we derive a …
Sequential optimality conditions play a major role in proving stronger global convergence results of numerical algorithms for nonlinear programming. Several extensions are …