Generic optimality conditions for semialgebraic convex programs

DOI10.1287/MOOR.1110.0481zbMATH Open1218.90189OpenAlexW1979709639MaRDI QIDQ3169129FDOQ3169129

Authors: Jérôme Bolte, A. Daniilidis, A. S. Lewis 

Publication date: 27 April 2011

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1110.0481

Recommendations

• Generic properties for semialgebraic programs
• Stability and genericity for semi-algebraic compact programs
• Generic minimizing behavior in semialgebraic optimization
• On the generic properties of convex optimization problems in conic form
• Optimality conditions for nonconvex semidefinite programming

zbMATH Keywords

sensitivity analysisconvex optimizationgenericactive setssemialgebraicsecond-order sufficient conditionspartial smoothnessidentifiable surface

Mathematics Subject Classification ID

Linear programming (90C05) Sensitivity, stability, parametric optimization (90C31) Sensitivity, stability, well-posedness (49K40) Semialgebraic sets and related spaces (14P10) Semi-analytic sets, subanalytic sets, and generalizations (32B20)

Cited In (24)

• A proximal method for composite minimization
• Qualification Conditions in Semialgebraic Programming
• The degrees of freedom of partly smooth regularizers
• Bounding duality gap for separable problems with linear constraints
• Stability and genericity for semi-algebraic compact programs
• Low complexity regularization of linear inverse problems
• The structure of completely positive matrices according to their CP-rank and CP-plus-rank
• Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
• Generic minimizing behavior in semialgebraic optimization
• First order solutions in conic programming
• Partial smoothness of the numerical radius at matrices whose fields of values are disks
• On continuous selections of polynomial functions
• Well-posedness in unconstrained polynomial optimization problems
• Generic properties for semialgebraic programs
• Linear Programming on the Stiefel Manifold
• Genericity results in linear conic programming -- a tour d'horizon
• Generic nondegeneracy in convex optimization
• Adiabatic approximation for a two-level atom in a light beam
• Semi-algebraic functions have small subdifferentials
• Nonsmooth optimization: conditioning, convergence and semi-algebraic models
• The dimension of semialgebraic subdifferential graphs
• Genericity and Hölder stability in semi-algebraic variational inequalities
• A note on alternating projections for ill-posed semidefinite feasibility problems
• Optimality conditions for static programming with generalized convexity

This page was built for publication: Generic optimality conditions for semialgebraic convex programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3169129)