Aubin property and uniqueness of solutions in cone constrained optimization
From MaRDI portal
Publication:2392811
DOI10.1007/s00186-013-0429-6zbMath1269.49039OpenAlexW2040758220MaRDI QIDQ2392811
Publication date: 2 August 2013
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://www.zora.uzh.ch/id/eprint/86943/13/ZORA_NL_86943.pdf
critical pointsconstraint nondegeneracyAubin propertycone constrained optimizationlocally single-valued solutions
Semidefinite programming (90C22) Sensitivity, stability, well-posedness (49K40) Sensitivity, stability, parametric optimization (90C31) Set-valued and variational analysis (49J53)
Related Items
Critical multipliers in variational systems via second-order generalized differentiation, On variational inequalities over polyhedral sets, Approximations and generalized Newton methods, Characterization of the Robust Isolated Calmness for a Class of Conic Programming Problems, Weak notions of nondegeneracy in nonlinear semidefinite programming, On Lipschitz continuity of projections onto polyhedral moving sets, Quantitative Analysis for Perturbed Abstract Inequality Systems in Banach Spaces, Unnamed Item, Computation of graphical derivatives of normal cone maps to a class of conic constraint sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Metric regularity, tangent sets, and second-order optimality conditions
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- Sensitivity analysis of generalized equations
- Perturbation analysis of second-order cone programming problems
- Isolated zeros of lipschitzian metrically regular -Functions
- On Metric Regularity for Weakly Almost Piecewise Smooth Functions and Some Applications in Nonlinear Semidefinite Programming
- On the Aubin Property of Critical Points to Perturbed Second-Order Cone Programs
- Implicit Functions and Solution Mappings
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
- Strongly Regular Generalized Equations
- Variational Analysis
- Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
- Metric regularity: characterizations, nonsmooth variations and successive approximation∗
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications