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

References

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