On the Closedness of the Linear Image of a Closed Convex Cone

Gábor Pataki
2007 Mathematics of Operations Research  
When is the linear image of a closed convex cone closed? We present very simple and intuitive necessary conditions that (1) unify, and generalize seemingly disparate, classical sufficient conditions such as polyhedrality of the cone, and Slater-type conditions; (2) are necessary and sufficient, when the dual cone belongs to a class that we call nice cones (nice cones subsume all cones amenable to treatment by efficient optimization algorithms, for instance, polyhedral, semidefinite, and
more » ... ; and (3) provide similarly attractive conditions for an equivalent problem: the closedness of the sum of two closed convex cones.
doi:10.1287/moor.1060.0242 fatcat:wbw4v4trzvgszgxrcslxx2lsca