Authors: Patrick Mehlitz

Based on the tools of limiting variational analysis, we derive a sequential necessary optimality condition for nonsmooth mathematical programs which holds without any additional assumptions. In order to ensure that stationary points in this new sense are already Mordukhovich-stationary, the presence of a constraint qualification which we call AM-regularity is necessary. We investigate the relationship between AM-regularity and other constraint qualifications from nonsmooth optimization like metric (sub-)regularity of the underlying feasibility mapping. Our findings are applied to optimization problems with geometric and, particularly, disjunctive constraints. This way, it is shown that AM-regularity recovers recently introduced cone-continuity-type constraint qualifications, sometimes referred to as AKKT-regularity, from standard nonlinear and complementarity-constrained optimization. Finally, we discuss some consequences of AM-regularity for the limiting variational calculus.

Comment: 30 pages, 2 figure

• 49J52 - Nonsmooth analysis
• 49J53 - Set-valued and variational analysis
• 90C30 - Nonlinear programming
• 90C33 - Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)