Invariance and efficiency of convex representations

Mathematical Programming

Volumn 111, Issue 1-2, 2008, Pages 113-140

  Chua, Chek Beng ^a   Tunçel, Levent ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Central path; Convex optimization; Interior point methods; Semidefinite programming; Semidefinite representations

Indexed keywords

MATHEMATICAL OPERATORS; NUMBER THEORY; PROBLEM SOLVING; SET THEORY; VECTORS;

CENTRAL PATH; CONVEX OPTIMIZATION; INTERIOR POINT METHODS; SEMIDEFINITE PROGRAMMING; SEMIDEFINITE REPRESENTATIONS;

MATHEMATICAL PROGRAMMING;

EID: 34347257132     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0072-6     Document Type: Conference Paper

References (23)

1. Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2001)
2. Braams, B.J.: Dual descriptions of semidefinite and other non-polyhedral cones. Manuscript, September (2002)
3. Chua, C.B.: A new notion of weighted centers for semidefinite programming. SIAM J. Optim. (in press)
4. Chua, C.B.: Relating homogeneous cones and positive definite cones via T-algebras. SIAM I Optim. 14, 500-506 (2004)
5. Chua, C.B.: An algebraic perspective on homogeneous cone programming, and the primal-dual second order cone approximations algorithm for symmetric cone programming. Ph.D. Thesis, Cornell University, May 2003
6. Faraut, J., Korányi, A.: Analysis on Symmetric Cones. Oxford University Press, New York (1994)
7. Faybusovich, L.: On Nesterov's approach to semi-infinite programming. Acta Appl. Math. 74, 195-215 (2002)
8. Gtller, O.: Hyperbolic polynomials and interior point methods for convex programming. Math. Oper. Res. 22, 350-377 (1997)
9. Helton, J.W., Vinnikov, V.: Linear matrix inequality representation of sets, 'technical Report (2002)
10. Lewis, A.S., Parrilo, P.A., Ramana, M.V.: The Lax conjecture is true. Proc. Amer. Math. Soc. 133, 2495-2499 (2005)
11. Monteiro, R.D.C., Tsuchiya, T.: Polynomial convergence of a new family of primal-dual algorithms for semidefinite programming. SIAM J. Optim. 9, 551-577 (1999)
12. Monteiro, R.D.C., Zanjácomo, P.: General interior-point maps and existence of weighted paths for nonlinear semidefinite complementarity problems. Math. Oper. Res. 25, 381-399 (2000)
13. Monteiro, R.D.C., Zanjácomo, P.: Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants. Optim. Method. Soft. 11/12, 91-140 (1999)
14. Nesterov, Yu.E., Nemirovskii, A.S.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia, PA (1994)
15. Nesterov, Yu.E., Todd, M.J.: Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22, 1-46 (1997)
16. Pataki, G.: Cone LP's and semidefinite programs: Geometry and a simplex type method. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. Proceedings of the Fifth IPCO Conference, (eds.) pp. 161-174. Springer, Berlin Heidelberg New York (1996)
17. Renegar, J.: Hyperbolic programs, and their derivative relaxations. Found. Comput. Math. 6, 59-79 (2006)
18. Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)
19. Truong, V.A., Tunçel, L.: Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers. Math. Prog. A 100, 295-316 (2004)
20. Tunçel, L. Wolkowicz H: Strengthened existence and uniqueness conditions for search directions in semidefinite programming. Linear Algebra Appl. 400, 31-60 (2005)
21. Tunçel, L., Xu, S.: On homogeneous convex cones, the Carathéodory number, and the duality mapping. Math. Oper. Res. 26, 234-247 (2001)
22. Vinberg, È.B.: The theory of homogeneous cones. Trans. Moscow Math. Soc. 12, 340-403 (1965)
23. Vinnikov, V.: Self-adjoint determinantal representations of real plane curves. Math. Ann. 296, 453-479 (1993)