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