Some new search directions for primal-dual interior point methods in semidefinite programming

SIAM Journal on Optimization

Volumn 11, Issue 1, 2000, Pages 223-242

  Toh, Kim Chuan ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Interior point methods; Search directions; Semidefinite programming

Indexed keywords

EID: 0034551321     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623498335067     Document Type: Article

References (17)

1. J. O. AASEN, On the reduction of a symmetric matrix to tridiagonal form, BIT, 11 (1971), pp. 233-242.
2. F. ALIZADEH, J. A. HAEBERLY, AND M. OVERTON, Complementarity and nondegeneracy in semidefinite programming, Math. Programming, 77 (1997), pp. 111-128.
3. F. ALIZADEH, J.-P. A. HAEBERLY, AND M. L. OVERTON, Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results, SIAM J. Optim., 8 (1998), pp. 746-768.
4. J. W. DEMMEL, The condition number of equivalence transformations that block diagonahze matrix pencils, SIAM J. Numer. Anal., 20 (1983), pp. 599-610.
5. K. FUJISAWA, M. KOJIMA, AND K. NAKATA, Exploiting sparsity in primal-dual interior-point methods for semidefinite programming, Math. Programming, 79 (1997), pp. 235-253.
6. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., Johns Hopkins University Press, Baltimore, MD, 1989.
7. M. GU, Primal-dual interior-point methods for semidefinite programming in finite precision, SIAM J. Optim., 10 (2000), pp. 462-502.
8. C. HELMBERG, F. RENDL, R. VANDERBEI, AND H. WOLKOWICZ, An interior-point method for semidefinite programming, SIAM J. Optim., 6 (1996), pp. 342-361.
9. 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.
10. R. D. C. MONTEIRO, Primal-dual path-following algorithms for semidefinite programming, SIAM J. Optim., 7 (1997), pp. 663-678.
11. R. D. C. MONTEIRO AND T. TSUCHIYA, Polynomial convergence of a new family of primal-dual algorithms for semidefinite programming, SIAM J. Optim., 9 (1999), pp. 551-577.
12. R. D. C. MONTEIRO AND P. R. ZANJÁCOMO, Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants, Optim. Methods Software, 11 (1999), pp. 91-140.
13. R. D. C. MONTEIRO AND Y. ZHANG, A unified analysis for a class of path-followmg primal-dual interior-point algorithms for semidefinite programming, Math. Programming. 81 (1998). pp. 281-299.
14. M. J. TODD, On search directions in interior-point methods for semidefinite programming. Optim. Methods Software, 11 (1999), pp. 1-46.
15. 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.
16. K. C. Ton, M. J. TODD, AND R. H. TÜTÜNCÜ, SDPT3-a Matlab software package for semidefinite programming, version 1.3, Optim. Methods Software, 11 (1999), pp. 545-581.
17. Y. ZHANG, On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming, SIAM J. Optim., 8 (1998), pp. 365-386.