On the closedness of the linear image of a closed convex cone

Mathematics of Operations Research

Volumn 32, Issue 2, 2007, Pages 395-412

  Pataki, Gábor ^a  

^a University of North Carolina at Chapel Hill   (United States)

Author keywords

Closed convex cone; Closedness; Common root of Slater's condition and polyhedrality; Duality; Linear image; Sum of closed convex cones

Indexed keywords

CLOSED CONVEX CONES; SUM OF CLOSED CONVEX CONES;

ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING;

IMAGE ANALYSIS;

EID: 38549138427     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1060.0242     Document Type: Article

References (25)

1. Alizadeh, F., J.-P. Haeberly, M. L. Overton. 1997. Complementarity and nondegeneracy in semidefinite programming. Math. Program. 77 111-128.
2. Auslender, A. 1996. Closedness criteria for the image of a closed set by a linear operator. Numer. Funct. Anal. Optim. 17 503-515.
3. Barker, G. P. 1973. The lattice of faces of a finite dimensional cone. Linear Algebra Appl. 7 71-82.
4. Barker, G. P. 1977. Faces and duality in convex cones. Linear Multilinear Algebra 6 161-169.
5. Barker, G. P. 1981. Theory of cones. Linear Algebra Appl. 39 263-291.
6. Barker, G. P., D. D. Carlson. 1975. Cones of diagonally dominant matrices. Pacific J. Math. 57 15-32.
7. Bauschke, H., J. M. Borwein. 1999. Conical open mapping theorems and regularity. Proc. Centre for Math. Its Appl., 36. Australian National University, Canberra, Australia, 1-10.
8. Berman, A. 1973. Cones, Matrices and Mathematical Programming. Springer, Berlin, Germany.
9. Blum, L., F. Cucker, M. Shub, S. Smale. 1998. Complexity and Real Computation. Springer, New York.
10. Bonnans, J. F., A. Shapiro. 2000. Perturbation Analysis of Optimization Problems. Springer, New York.
11. Borwein, J. M., H. Wolkowicz. 1981. Regularizing the abstract convex program. J. Math. Anal. Appl. 83 495-530.
12. Brondsted, A. 1983. An Introduction to Convex Polytopes. Springer, Berlin, Germany.
13. Duffin, R. J. 1956. Infinite programs. A. W. Tucker, ed. Linear Equalities and Related Systems. Princeton University Press, Princeton, NJ, 157-170.
14. Duffin, R. J., R. G. Jeroslow, L. A. Karlovitz. 1983. Duality in semi-infinite linear programming. Semi-Infinite Programming and Applications (Austin, TX, 1981). Lecture Notes in Econom. and Math. Systems, Vol. 215. Springer, Berlin, Germany, 50-62.
15. Hiriart-Urruty, J. B., C. Lemarechal. 1993. Convex Analysis and Minimization Algorithms. Springer, Berlin, Germany.
16. Holmes, R. B. 1975. Geometric Functional Analysis and Its Applications. Springer, Berlin, Germany.
17. Pataki, G. A partial characterization of nice cones. Submitted.
18. Pataki, G. 2000. The geometry of semidefinite programming. R. Saigal, L. Vandenberghe, H. Wolkowicz, eds. Handbook of Semidefinite Programming. Kluwer Academic Publishers, Waterloo, Ontario, Canada.
19. Ramana, M. V. 1997. An exact duality theory for semidefinite programming and its complexity implications. Math. Program. 77 129-162.
20. Ramana, M., L. Tuncel, H. Wolkowicz. 1997. Strong duality for semidefinite programming. SIAM J. Optim. 7(3) 641-662.
21. Renegar, J. 2001. A Mathematical View of Interior-Point Methods in Convex Optimization, MPS-SIAM Series on Optimization. SIAM, Philadelphia, PA.
22. Rockafellar, R. T. 1970. Convex Analysis. Princeton University Press, Princeton, NJ.
23. Schrijver, A. 1986. Theory of Linear and Integer Programming. John Wiley & Sons, New York.
24. Tam, B.-S. 1985. On the duality operator of a convex cone. Linear Algebra Appl. 64 33-56.
25. Waksman, Z., M. Epelman. 1976. On point classification in convex sets. Math. Scand. 38 83-96.