Generic optimality conditions for semialgebraic convex programs

DOI10.1287/MOOR.1110.0481MaRDI QIDQ3169129zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

active setsconvex optimizationgenericidentifiable surfacepartial smoothnesssecond-order sufficient conditionssemialgebraicsensitivity analysis

Mathematics Subject Classification ID

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

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

Cited in

(26)

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

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)