Lipschitz and Hölder stability of optimization problems and generalized equations

Abstract

This paper studies stability aspects of solutions of parametric mathematical programs and generalized equations, respectively, with disjunctive constraints. We present sufficient conditions that, under some constraint qualifications ensuring metric subregularity of the constraint mapping, continuity results of upper Lipschitz and upper Hölder type, respectively, hold. Furthermore, we apply the above results to parametric mathematical programs with equilibrium constraints and demonstrate, how some classical results for the nonlinear programming problem can be recovered and even improved by our theory.

References in corpus (1)

• Optimality conditions for disjunctive programs based on generalized differentiation with application to mathematical programs with equilibrium constraints

Cited by in corpus (13)

• On Lipschitzian properties of implicit multifunctions
• Asymptotic stationarity and regularity for nonsmooth optimization problems
• On estimating the regular normal cone to constraint systems and stationarity conditions
• On implicit variables in optimization theory
• On inner calmness*, generalized calculus, and derivatives of the normal cone mapping
• Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis
• Directional necessary optimality conditions for bilevel programs
• Verifiable sufficient conditions for the error bound property of second-order cone complementarity problems
• Directional quasi/pseudo-normality as sufficient conditions for metric subregularity
• Computation of graphical derivatives of normal cone maps to a class of conic constraint sets
• Several classes of stationary points for rank regularized minimization problems
• Stability analysis for parameterized variational systems with implicit constraints
• New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints