Facially Exposed Cones Are Not Always Nice
From MaRDI portal
Publication:4979867
DOI10.1137/130922069zbMath1291.90175arXiv1301.1000OpenAlexW2153997639MaRDI QIDQ4979867
Publication date: 19 June 2014
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.1000
Convex programming (90C25) Convex sets in (3) dimensions (including convex surfaces) (52A15) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items
First order solutions in conic programming ⋮ Error bounds, facial residual functions and applications to the exponential cone ⋮ Self-Dual Polyhedral Cones and Their Slack Matrices ⋮ Hyperbolicity cones are amenable ⋮ Bad Semidefinite Programs: They All Look the Same ⋮ Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming ⋮ Amenable cones: error bounds without constraint qualifications ⋮ Facially Dual Complete (Nice) Cones and Lexicographic Tangents ⋮ Exact Duality in Semidefinite Programming Based on Elementary Reformulations ⋮ Amenable Cones Are Particularly Nice
