On the connection of facially exposed and nice cones

Journal of Mathematical Analysis and Applications

Volumn 400, Issue 1, 2013, Pages 211-221

  Pataki, Gábor ^a  

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

Author keywords

Closed convex cones; Faces; Facially exposed cones; Nice cones

Indexed keywords

EID: 84871699590     PISSN: 0022247X     EISSN: 10960813     Source Type: Journal    
DOI: 10.1016/j.jmaa.2012.10.033     Document Type: Article

References (24)

1. Duffin Richard J. Infinite programs. Linear Inequalities and Related Systems 1956, 157-170. Princeton University Press. A.W. Tucker (Ed.).
2. Nesterov Yurii E., Nemirovskii Arkady S. Interior Point Polynomial Algorithms in Convex Programming 1994, SIAM Publications, SIAM, Philadelphia, USA.
3. Alizadeh Farid, Goldfarb Donald Second-order cone programming. Math. Program. Ser. B 2003, 95:3-51.
4. Todd Michael J. Semidefinite programming. Acta Numer. 2001, 10:515-560.
5. Güler Osman Foundations of Optimization. Graduate Texts in Mathematics 2010, Springer.
6. Barker George Phillip, Carlson David Cones of diagonally dominant matrices. Pacific J. Math. 1975, 57:15-32.
7. Pataki Gábor The geometry of semidefinite programming. Handbook of Semidefinite Programming 2000, Kluwer Academic Publishers, also available from www.unc.edu/~pataki. R. Saigal, L. Vandenberghe, H. Wolkowicz (Eds.).
8. Burer Samuel On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 2009, 120:479-495.
9. Duer Mirjam Copositive programming-a survey. Recent Advances in Optimization and Its Applications in Engineering 2010, 3-20. Springer-Verlag. M. Diehl, F. Glineur, E. Jarlebring, W. Michiels (Eds.).
10. Anstreicher Kurt, Burer Samuel, Duer Mirjam The difference between 5×5 doubly nonnegative and completely positive matrices. Linear Algebra Appl. 2009, 431:1539-1552.
11. Dickinson Peter J.C. Geometry of the copositive and completely positive cones. J. Math. Anal. Appl. 2011, 380:377-395.
12. Borwein Jonathan M., Wolkowicz Henry Regularizing the abstract convex program. J. Math. Anal. App. 1981, 83:495-530.
13. Waki Hayato, Muramatsu Masakazu A facial reduction algorithm for finding sparse SOS representations. Oper. Res. Lett. 2010, 38:361-365.
14. Imre Pólik, Tamás Terlaky, Exact duality for optimization over symmetric cones, Technical Report, Lehigh University, Bethlehem, PA, USA, 2009.
15. Pataki Gábor On the closedness of the linear image of a closed convex cone. Math. Oper. Res. 2007, 32(2):395-412.
16. João Gouveia, Pablo Parrilo, Rekha Thomas, Lifts of convex sets and cone factorizations, Math. Oper. Res. (in press).
17. Rockafellar Tyrrel R. Convex Analysis 1970, Princeton University Press, Princeton, NJ, USA.
18. Borwein Jonathan M., Lewis Adrian S. Convex Analysis and Nonlinear Optimization: Theory and Examples. CMS Books in Mathematics 2000, Springer.
19. Berman Abraham Cones, Matrices and Mathematical Programming 1973, Springer-Verlag, Berlin, New York.
20. Tam Bit-Shun On the duality operator of a convex cone. Linear Algebra Appl. 1985, 64:33-56.
21. Barker George Phillip The lattice of faces of a finite dimensional cone. Linear Algebra Appl. 1973, 7:71-82.
22. Lewis Adrian S. Eigenvalue constrained faces. Linear Algebra Appl. 1998, 269:159-181.
23. Chua Check-Beng, Tunçel Levent Invariance and efficiency of convex representations. Math. Program. B 2008, 111:113-140.
24. Dubins Lester E. On extreme points of convex sets. J. Math. Anal. Appl. 1962, 5:237-244.