On the Nesterov-Todd direction in semidefinite programming

SIAM Journal on Optimization

Volumn 8, Issue 3, 1998, Pages 769-796

  Todd, M J ^a   Toh, K C ^b   Tutuncu R H ^c  

^a Cornell University   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Newton direction; Predictor corrector interior point method; Semidefinite programming

Indexed keywords

EID: 0032359979     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S105262349630060X     Document Type: Article

References (24)

1. F. ALIZADEH, Combinatorial Optimization with Interior Point Methods and Semi-definite Matrices, Ph.D. thesis, University of Minnesota, Minneapolis, MN, 1991.
2. F. ALIZADEH, Semidefinite programming home page, http://rutcor.rutgers.edu/~alizadeh/ sdp.html.
3. F. ALIZADEH, J. A. 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. T. ANDO, Concavity of certain maps and positive definite matrices and applications to Hadamard products, Linear Algebra Appl., 26 (1979), pp. 203-241.
5. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., The Johns Hopkins University Press, Baltimore, MD, 1989.
6. C. HELMBERG, Semidefinite programming home page, http://www.zib.de/helmberg/ semidef.html.
7. C. HELMBERG, F. RENDL, R. VANDERBEI, AND H. WOLKOWICZ, An interior-point method for semidefinite programming, SIAM J. Optim., 6 (1996), pp. 342-361.
8. R. HORN, private communication, University of Utah, Salt Lake City, UT, 1996.
9. M. KOJIMA, private communication, Tokyo Institute of Technology, Japan, 1996.
10. 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.
11. C.-J. LIN AND R. SAIGAL, A Predictor Corrector Method for Semi-definite Linear Programming, manuscript, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI, 1995.
12. S. MEHROTRA, On the implementation of a primal-dual interior point method, SIAM J. Optim., 2 (1992), pp. 575-601.
13. THE MATHWORKS, INC., MATLAB Reference Guide, The MathWorks, Inc., Natick, MA, 1992.
14. R. D. C. MONTEIRO, Primal-dual path-following algorithms for semidefinite programming, SIAM J. Optim., 7 (1997), pp. 663-678.
15. Y. NESTEROV AND A. S. NEMIROVSKII, Conic formulation of a convex programming problem and duality, Optimization Methods and Software, 1 (1992), pp. 95-115.
16. Y. NESTEROV AND A. S. NEMIROVSKII, Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms, SIAM, Philadelphia, PA, 1994.
17. Y. NESTEROV AND M. J. TODD, Self-scaled barriers and interior-point methods in convex programming, Math. Oper. Res., 22 (1997), pp. 1-42.
18. Y. NESTEROV AND M. J. TODD, Primal-dual interior-point methods for self-scaled cones, SIAM J. Optim., 8 (1998), pp. 324-364.
19. M. SHIDA, S. SHINDOH, AND M. KOJIMA, Existence of search directions in interior-point algorithms for the SDP and the monotone SDLCP, SIAM J. Optim., 8 (1998), pp. 387-396.
20. J. F. STURM AND S. ZHANG, Symmetric Primal-Dual Path Following Algorithms for Semidefinite Programming, Tech. Report 9554/A, Econometric Institute, Erasmus University, Rotterdam, The Netherlands, 1995.
21. K. C. TOH AND L. N. TREFETHEN, The Chebyshev polynomials of a matrix, SIAM J. Matrix Anal. Appl., to appear.
22. L. VANDENBERGHE AND S. BOYD, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95.
23. Y. ZHANG, On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming, SIAM J. Optim., 8 (1998), pp. 365-386.
24. Y. ZHANG, private communication, University of Maryland Baltimore County, Baltimore, MD, 1996.