Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results

SIAM Journal on Optimization

Volumn 8, Issue 3, 1998, Pages 746-768

  Alizadeh, Farid ^a   Haeberly, Jean Pierre A ^b   Overton, Michael L ^c  

^a RUTGERS UNIVERSITY   (United States)

^b FORDHAM UNIVERSITY   (United States)

^c POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Convex programming; Eigenvalue optimization; Interior point method; Semidefinite programming

Indexed keywords

EID: 0032327612     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623496304700     Document Type: Article

References (20)

1. F. ALIZADEH, J.-P. A. HAEBERLY, AND M. L. OVERTON, A new primal-dual interior-point method for semidefinite programming, in Proc. 5th SIAM Conference on Applied Linear Algebra, J.G. Lewis, ed., SIAM, Philadelphia, 1994, pp. 113-117.
2. F. ALIZADEH, J.-P. A. HAEBERLY, AND M. L. OVERTON, Primal-dual interior-point methods for semidefinite programming, manuscript presented at the Math. Programming Symposium, Ann Arbor, MI, 1994.
3. F. ALIZADEH, J.-P. A. HAEBERLY, AND M. L. OVERTON, Complementarity and nondegeneracy in semidefinite programming, Math. Programming, 77 (1997), pp. 111-128.
4. F. ALIZADEH, Combinatorial Optimization with Interior Point Methods and Semidefinite Matrices, Ph.D. thesis, University of Minnesota, Minneapolis, MN, 1991.
5. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, New York, 1988.
6. C. HELMBERG, F. RENDL, R. VANDERBEI, AND H. WOLKOWICZ, An interior-point method for semidefinite programming, SIAM J. Optim., 6 (1996), pp. 342-361.
7. M. KOJIMA, S. SHINDOH, AND S. HARA, Interior-point methods for the monotone linear complementarity problem in symmetric matrices, SIAM J. Optim., 7 (1997), pp. 86-125.
8. 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.
9. R. MONTEIRO, Polynomial convergence of primal-dual algorithms for semidefinite programming based on Monteiro and Zhang family of directions, SIAM J. Optim., 8 (1998), pp. 797-812.
10. R. MONTEIRO AND P. ZANJACOMO, A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming, Math. Programming, 78 (1997), pp. 393-396.
11. Y. NESTEROV AND A. NEMIROVSKII, Interior Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, 1994.
12. Y. NESTEROV AND M. TODD, Primal-dual interior-point methods for self-scaled cones, SIAM J. Optim., 8 (1998), pp. 324-364.
13. Y. NESTEROV AND M. TODD, Self-scaled barriers and interior-point methods for convex programming, Math. Oper. Res., 22 (1997), pp. 393-396.
14. M. L. OVERTON AND R. S. WOMERSLEY, Second derivatives for optimizing eigenvalues of symmetric matrices, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 697-718.
15. M. SHIDA, S. SHINDOH, AND M. KOJIMA, Existence and uniqeness of search directions in interior-point algorithms for the SDP and the monotone SDLCP, SIAM J. Optim., 8 (1998), pp. 387-398.
16. 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.
17. L. VANDENBERGHE AND S. BOYD, Primal-dual potential reduction method for problems involving matrix inequalities, Math. Programming B, 69 (1995), pp. 205-236.
18. S. J. WRIGHT, Primal-Dual Interior-Point Methods, SIAM, Philadelphia, 1997.
19. Y. ZHANG, On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming, SIAM J. Optim., 8 (1998), pp. 365-386.
20. Y. ZHANG, R. A. TAPIA, AND J. E. DENNIS, On the superlinear and quadratic convergence of primal-dual interior point linear programming algorithms. SIAM J. Optim., 2 (1992), pp. 304-324.