Second-order characterizations of Lipschitz stability in nonlinear programming (Q1417347)

We study critical and stationary points of perturbed \(C^{1,1}\) optimization problems and characterize three types of Lipschitz stability in terms of contingent and Thibault derivatives for the mapping in question: strong regularity, upper Lipschitz behavior, and pseudo-Lipschitz behavior. It turns out that there is a full similarity with respect to stability conditions, quadratic approximation, and geometrical interpretation when comparing strong regularity and upper Lipschitz behavior of critical points. The only difference arises from the derivatives one has to apply, and these derivatives are determined in terms of the original data. In particular, the explicit formula for the contingent derivative of the stationary point map \(X\) under the Mangasarian-Fromowitz constraint qualification leads to criteria for both the pseudo- and upper Lipschitz behavior of \(X\). Our approach is essentially based on the analysis of the associated Kojima function, a product of a matrix function \(M(x)\) and a vector function containing terms of the form \((y^+,y^-)\), only. Applications to Lipschitz stability of optimal solutions are also discussed.