Abstract:
A survey is given of old and new results on the sensitivity of solutions to systems of optimality conditions with respect to parametric perturbations. Results of this kind play a key role in subtle convergence analysis of various constrained optimization algorithms. General systems of optimality conditions for problems with abstract constraints, Karush–Kuhn–Tucker systems for mathematical programs, and Lagrange systems for problems with equality constraints are examined. Special attention is given to the cases where the traditional constraint qualifications are violated.