Strong stability of stationary solutions and Karush-Kuhn-Tucker points in nonlinear optimization
From MaRDI portal
Publication:1813594
DOI10.1007/BF02055199zbMath0746.90070MaRDI QIDQ1813594
Publication date: 25 June 1992
Published in: Annals of Operations Research (Search for Journal in Brave)
survey; perturbations; strong stability; strongly regular Karush- Kuhn-Tucker points; strongly stable stationary solutions
90C30: Nonlinear programming
90C31: Sensitivity, stability, parametric optimization
49J52: Nonsmooth analysis
Related Items
A proof of the necessity of linear independence condition and strong second-order sufficient optimality condition for Lipschitzian stability in nonlinear programming, Characterization of strong stability for C-stationary points in MPCC, On the semismoothness of projection mappings and maximum eigenvalue functions, Perturbing convex multiobjecttve programs, Strong stability implies Mangasarian–Fromovitz Constraint Qualification, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On inertia and Schur complement in optimization
- Sufficient conditions for local optimality in multidimensional control problems with state restrictions
- On the inverse function theorem
- Lipschitzian inverse functions, directional derivatives, and applications in \(C^{1,1}\) optimization
- On Iterated Minimization in Nonconvex Optimization
- On the numerical feasibility of continuation methods for nonlinear programming problems
- Ein implementierbares einbettungsverfahren der nichttinearen optimierang
- On uniqueness of Kuhn-Tucker multipliers in nonlinear programming
- Continuous deformation of nonlinear programs
- On the Regularity of the Kuhn–Tucker Curve
- On second-order sufficient optimality conditions for c 1,1-optimization problems
- Strongly Regular Generalized Equations
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
