Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions

Mathematical Programming, Series B

Volumn 88, Issue 1, 2000, Pages 61-83

  Monteiro, Renato D C ^a   Tsuchiya, Takashi ^b  

^a Georgia Institute of Technology   (United States)

^b INSTITUTE OF STATISTICAL MATHEMATICS   (Japan)

Author keywords

Ice cream cone; Interior point methods; Newton method; Path following methods; Polynomial complexity; Primal dual methods; Second order cone programming

Indexed keywords

EID: 0001856065     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00011378     Document Type: Article

References (32)

1. Adler, I., Alizadeh, F. (1994): Primal-dual interior-point algorithms for convex quadratically constrained and semidefinite optimization problems. Manuscript, May, 1994 (Revised: August, 1995)
2. Alizadeh, F., Haeberly, J.-P., Overton, M. (1998): Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results. SIAM J. Optim., 8, 746-768
3. Alizadeh, F., Schmieta, S. (1997): Optimization with semidefinite, quadratic and linear constraints. Technical Report RRR 23-97, RUTCOR Research Report, Rutgers University, NJ, USA, November 1997
4. Faybusovich, L. (1995): Jordan algebras, symmetric cones and interior-point methods. Manuscript, Department of Mathematics, Notre Dame, IN, USA
5. Faybusovich, L. (1997): Linear systems in Jordan algebras and primal-dual interior-point algorithms. J. Comput. Appl. Math. 86, 149-175
6. Faybusovich, L. (1997): Euclidean Jordan algebras and interior-point algorithms. Positivity 1, 331-357
7. Faraut, J., Koráyi, A. (1994): Analysis on Symmetric Cones. Oxford University Press, New York
8. Helmberg, C., Rendl, F., Vanderbei, R.J., Wolkowicz, H. (1996): An interior-point method for semidefinite programming. SIAM J. Optim. 6, 342-361
9. Jarre, F. (1990/91): On the convergence of the method of analytic centers when applied to convex quadratic programs. Math. Program. 49, 341-359
10. Jarre, F., Kocvara, M., Zowe, J. (1995): Optimal truss topology design by interior point methods. Cooperative Research Report of the Institute of Statistical Mathematics 77, 236-252
11. Kojima, M., Mizuno, S., Yoshise, A. (1989): A primal-dual interior point algorithm for linear programming. In: Megiddo, N., ed., Progress in Mathematical Programming, Interior-point and Related Methods, Springer-Verlag, New York, pp. 29-47
12. Kojima, M., Mizuno, S., Yoshise, A. (1989): A polynomial-time algorithm for a class of linear complementarity problems. Math. Program. 44, 1-26
13. Kojima, M., Shindoh, S., Hara, S. (1997): Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM J. Optim. 7, 86-125
14. Lobo, M., Vandenberghe, L., Boyd, S., Lebret, H. (1998): Applications of second-order cone programming. Linear Algebra Appl. 284, 193-228
15. Mehrotra, S., Sun, J. (1991): A method of analytic centers for quadratically constrained convex quadratic programs. SIAM J. Numer. Anal. 28, 529-544
16. Mizuno, S., Todd, M.J., Ye, Y. (1993): On adaptive-step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. 18, 964-981
17. Monteiro, R.D.C. (1997): Primal-dual path-following algorithms for semidefinite programming. SIAM J. Optim. 7, 663-678
18. Monteiro, R.D.C. (1998): Polynomial convergence of primal-dual algorithms for semidefinite programming based on Monteiro and Zhang family of directions. SIAM J. Optim. 8, 797-812
19. Monteiro, R.D.C., Adler, I. (1989): Interior path-following primal-dual algorithms, Part I: Linear programming. Math. Program. 44, 27-41
20. Monteiro, R.D.C., Adler, I. (1989): Interior path-following primal-dual algorithms, Part II: Convex quadratic programming. Math. Program. 44, 43-66
21. Monteiro, R.D.C., Tsuchiya, T. (1999): Polynomial convergence of a new family of primal-dual algorithms for semidefinite programming. SIAM J. Optim. 9, 551-577
22. Monteiro, R.D.C., Zhang, Y. (1998): A unified analysis for a class of path-following primal-dual interior-point algorithms for semidefinite programming. Math. Program. 81, 281-299
23. Nesterov, Yu., Nemirovskii, A. (1988): Polynomial barrier methods in convex programming. Ekonomika i Matem. Metody 24, 1084-1091
24. Nesterov, Yu., Nemirovskii, A (1994): Interior point polynomial methods in convex programming. SIAM Publications, Philadelphia, Pennsylvania, USA
25. Nesterov, Y.E., Todd, M. (1997): Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22, 1-42
26. Nesterov, Y.E., Todd, M. (1998): Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8, 324-364
27. Schmieta, S., Alizadeh, F. (1998): Associative algebras, symmetric cones and polynomial time interior point algorithms. Report RRR 17-98, RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ 08854-8003
28. Sturm, J.F. (1998): Similarity and other spectral relations for symmetric cones. Manuscript. Communications Research Laboratory, McMaster University, Hamilton, Canada
29. Tsuchiya, T. (1997): A polynomial primal-dual path-following algorithm for second-order cone programming. Research Memorandum No. 649, The Institute of Statistical Mathematics, Tokyo, Japan, October (Revised: December 1997)
30. Tsuchiya, T. (1999): A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming. Optim. Methods Software 11&12, 141-182
31. Xue, G., Ye, Y. (1997): Efficient algorithms for minimizing a sum of Euclidean norms with applications. SIAM J. Optim. 7, 1017-1036
32. Zhang, Y. (1998): On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8, 365-386