On the Closedness of the Linear Image of a Closed Convex Cone
From MaRDI portal
Publication:5388037
DOI10.1287/moor.1060.0242zbMath1341.90146MaRDI QIDQ5388037
Publication date: 27 May 2008
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/4d8a1141353280e9f1ab8f27f2b68537ec0ba8c7
duality; closedness; closed convex cone; linear image; common root of Slater's condition and polyhedrality; sum of closed convex cones
90C46: Optimality conditions and duality in mathematical programming
52A40: Inequalities and extremum problems involving convexity in convex geometry
49N15: Duality theory (optimization)
Related Items
Unnamed Item, A note on strict complementarity for the doubly non-negative cone, Unnamed Item, Facially Dual Complete (Nice) Cones and Lexicographic Tangents, Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs, Coordinate Shadows of Semidefinite and Euclidean Distance Matrices, Preprocessing and Regularization for Degenerate Semidefinite Programs, Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization, On Optimality Conditions for Nonlinear Conic Programming, Amenable Cones Are Particularly Nice, Unnamed Item, Error bounds, facial residual functions and applications to the exponential cone, Lagrangian duality in convex conic programming with simple proofs, Minimization of semicoercive functions: a generalization of Fichera's existence theorem for the Signorini problem, A note on Robinson-Ursescu and Lyusternik-Graves theorem, Weak infeasibility in second order cone programming, A regularized strong duality for nonsymmetric semidefinite least squares problem, Revisiting some rules of convex analysis, The minimal cone for conic linear programming, Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs, On cone of nonsymmetric positive semidefinite matrices, A fresh CP look at mixed-binary QPs: new formulations and relaxations, Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming, Lyapunov-type least-squares problems over symmetric cones, Strong duality and minimal representations for cone optimization, Existence of Pareto solutions for vector polynomial optimization problems with constraints, Approximate cone factorizations and lifts of polytopes, A complementarity partition theorem for multifold conic systems, Bad Semidefinite Programs: They All Look the Same
