Polynomial convergence of primal-dual algorithms for semidefinite programming based on the Monteiro and Zhang family of directions

SIAM Journal on Optimization

Volumn 8, Issue 3, 1998, Pages 797-812

  Monteiro, Renato D C ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Interior point methods; Path following methods; Polynomial complexity; Primal dual methods; Semidefinite programming

Indexed keywords

EID: 0032333697     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623496308618     Document Type: Article

References (34)

1. F. ALIZADEH, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim., 5 (1995), pp. 13-51.
2. F. ALIZADEH, J.-P. HAEBERLY, AND M. OVERTON, Primal-dual Interior-point Methods for Semidefinite Programming, Technical Report 659, Computer Science Department, Courant Institute of Mathematical Sciences, New York University, New York, NY, 1994.
3. F. ALIZADEH, J.-P. HAEBERLY, AND M. OVERTON, Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results, SIAM J. Optim., 8 (1998), pp. 746-768.
4. R. M. FREUND, Complexity of an Algorithm for Finding an Approximate Solution of a Semidefinite Program with No Regularity Condition, Working paper OR 302-94, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA, December 1994.
5. C. HELMBERG, F. RENDL, R. J. VANDERBEI, AND H. WOLKOWICZ, An interior-point method for semidefinite programming, SIAM J. Optim., 6 (1996), pp. 342-361.
6. R. A. HORN AND C. R. JOHNSON, Matrix Analysis, Cambridge University Press, New York, 1985.
7. F. JARRE, An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices, SIAM J. Control Optim., 31 (1993), pp. 1360-1377.
8. M. KOJIMA, S. MIZUNO, AND A. YOSHISE, A polynomial-time algorithm for a class of linear complementarity problems, Math. Programming, 44 (1989), pp. 1-26.
9. M. KOJIMA, S. MIZUNO, AND A. YOSHISE, A primal-dual interior point algorithm for linear programming, in Progress in Mathematical Programming: Interior Point and Related Methods, N. Megiddo, ed., Springer-Verlag, New York, 1989, pp. 29-47.
10. M. KOJIMA, M. SHIDA, AND S. SHINDOH, Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs, Math. Programming, 80 (1998), pp. 129-160.
11. M. KOJIMA, M. SHIDA, AND S. SHINDOH, A Note on the Nesterov-Todd and the Kojima-Shindoh-Hara Search Directions in Semidefinite Programming, Research Report B-313, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro-ku, Tokyo, Japan, April 1996.
12. M. KOJIMA, M. SHIDA, AND S. SHINDOH, A predictor-corrector interior-point algorithm for the semidefinite linear complementarity problem using the Alizadeh-Haeberly-Overton search direction, SIAM J. Optim., to appear.
13. M. KOJIMA, S. SHINDOH, AND S. HARA, Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices, SIAM J. Optim., 7 (1997), pp. 86-125.
14. C.-J. LIN AND R. SAIGAL, A Predictor-corrector Method for Semi-definite Programming, Working paper, Dept. of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI, 1995.
15. Z.-Q. LUO, J. F. STURM, AND S. ZHANG, Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming, SIAM J. Optim., 8 (1998), pp. 59-81.
16. S. MIZUNO, M. J. TODD, AND Y. YE, On adaptive step primal-dual interior-point algorithms for linear programming, Math. Oper. Res., 18 (1993), pp. 945-981.
17. R. D. C. MONTEIRO, Primal-dual path following algorithms for semidefinite programming, SIAM J. Optim., 7 (1997), pp. 663-678.
18. R. D. C. MONTEIRO AND I. ADLER, Interior path-following primal-dual algorithms. Part I: Linear programming, Math. Programming, 44 (1989), pp. 27-41.
19. R. D. C. MONTEIRO AND I. ADLER, Interior path-following primal-dual algorithms. Part II: Convex quadratic programming, Math. Programming, 44 (1989), pp. 43-66.
20. R. D. C. MONTEIRO AND P. ZANJÁCOMO, A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming, Math. Programming, 78 (1997), pp. 393-396.
21. R. D. C. MONTEIRO AND Y. ZHANG, A unified analysis for a class of path-following primal-dual interior-point algorithms for semidefinite programming, Math. Programming, 81 (1998), pp. 281-299.
22. Y. E. NESTEROV AND A. S. NEMIROVSKII, Polynomial barrier methods in convex programming, Ekonomika i Matem. Metody, 24 (1988), pp. 1084-1091 (in Russian; English translation in Matekon: Translations of Russian and East European Math. Economics).
23. Y. E. NESTEROV AND A. S. NEMIROVSKII, Self-concordant Functions and Polynomial Time Methods in Convex Programming, preprint, Central Economic & Mathematical Institute, USSR Acad. Sci. Moscow, USSR, 1989.
24. Y. E. NESTEROV AND A. S. NEMIROVSKII, Optimization Over Positive Semidefinite Matrices: Mathematical Background and User's Manual, Technical report, Central Economic & Mathematical Institute, USSR Acad. Sci. Moscow, USSR, 1990.
25. Y. E. NESTEROV AND A. S. NEMIROVSKII, Interior Point Methods in Convex Programming: Theory and Applications, SIAM, Philadelphia, PA, 1994.
26. Y. E. NESTEROV AND M. TODD, Primal-dual interior-point methods for self-scaled cones, SIAM J. Optim., 8 (1998), pp. 324-364.
27. Y. E. NESTEROV AND M. TODD, Self-scaled barriers and interior-point methods for convex programming, Math. Oper. Res., 22 (1997), pp. 1-42.
28. F. A. POTRA AND R. SHENG, A superlinearly convergent primal-dual infeasible-interior-point algorithm for semidefinite programming, SIAM J. Optim., to appear.
29. J. F. STURM AND S. ZHANG, Symmetric Primal-dual Path-following Algorithms for Semidefinite Programming, Report 9554/A, Econometric Institute, Erasmus University, Rotterdam, The Netherlands, November 1995.
30. M. J. TODD, K. C. TOH, AND R. H. TÜTÜNCÜ, On the Nesterov-Todd direction in semidefinite programming, SIAM J. Optim., 8 (1998), pp. 769-796.
31. P. TSENG, Search directions and convergence analysis of some infeasible path-following methods for the monotone semi-definite LCP, Optim. Meth. and Software, to appear.
32. L. VANDENBERGHE AND S. BOYD, A primal-dual potential reduction method for problems involving matrix inequalities, Math. Programming, 69 (1995), pp. 205-236.
33. Y. YE, A class of protective transformations for linear programming, SIAM J. Comput., 19 (1990), pp. 457-466.
34. Y. ZHANG, On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming, SIAM J. Optim., 8 (1998), pp. 365-386.