On the boundedness of multipliers in augmented Lagrangian methods for mathematical programs with complementarity constraints

In this paper, we analyze augmented Lagrangian (AL) methods for mathematical programs with complementarity constraints (MPCCs), with emphasis on a variant that reformulates the complementarity constraints by slack variables and preserves them explicitly in the subproblems instead of penalizing them. Motivated by recent developments in nonlinear programming, we study quasi-normality-type constraint qualifications tailored to this … Read more

Regularizing Bilevel Nonlinear Programs by Lifting

This paper considers a bilevel nonlinear program (NLP) whose lower-level problem satisfies a linear independence constraint qualification (LICQ) and a strong second-order condition (SSOC). One would expect the resulting mathematical program with complementarity constraints (MPCC), whose constraints are the first-order optimality conditions of the lower-level NLP, to satisfy an MPEC-LICQ. We provide an example which … Read more