Generic Optimality Conditions for Semialgebraic Convex Programs
From MaRDI portal
Publication:3169129
DOI10.1287/moor.1110.0481zbMath1218.90189OpenAlexW1979709639MaRDI QIDQ3169129
Jérôme Bolte, Aris Daniilidis, Adrian 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
convex optimizationsensitivity analysisgenericactive setssemialgebraicsecond-order sufficient conditionspartial smoothnessidentifiable surface
Sensitivity, stability, well-posedness (49K40) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Semialgebraic sets and related spaces (14P10) Semi-analytic sets, subanalytic sets, and generalizations (32B20)
Related Items
Bounding duality gap for separable problems with linear constraints ⋮ Stability and genericity for semi-algebraic compact programs ⋮ 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 ⋮ Genericity and Hölder stability in semi-algebraic variational inequalities ⋮ The degrees of freedom of partly smooth regularizers ⋮ First order solutions in conic programming ⋮ On continuous selections of polynomial functions ⋮ Generic Properties for Semialgebraic Programs ⋮ Genericity Results in Linear Conic Programming—A Tour d’Horizon ⋮ The dimension of semialgebraic subdifferential graphs ⋮ Partial Smoothness of the Numerical Radius at Matrices Whose Fields of Values are Disks ⋮ The structure of completely positive matrices according to their CP-rank and CP-plus-rank ⋮ A note on alternating projections for ill-posed semidefinite feasibility problems ⋮ Well-Posedness in Unconstrained Polynomial Optimization Problems ⋮ Generic Minimizing Behavior in Semialgebraic Optimization ⋮ Generic nondegeneracy in convex optimization ⋮ Low Complexity Regularization of Linear Inverse Problems
