On the long-step path-following method for semidefinite programming

Operations Research Letters

Volumn 22, Issue 4-5, 1998, Pages 145-150

  Sturm, Jos F ^a   Zhang, Shuzhong ^b  

^a TINBERGEN INSTITUTE   (Netherlands)

^b ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

Author keywords

Long step path following; Semidefinite programming; Symmetric primal dual transformation

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CRITICAL PATH ANALYSIS; DECISION THEORY; ITERATIVE METHODS; MATHEMATICAL TRANSFORMATIONS;

LONG-STEP PATH FOLLOWING; SEMIDEFINITE PROGRAMMING; SYMMETRIC PRIMAL-DUAL TRANSFORMATIONS;

MATHEMATICAL PROGRAMMING;

EID: 0032058382     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(98)00014-5     Document Type: Article

References (17)

1. F. Alizadeh, J.-P.A. Haeberley, M.L. Overton, Primal-dual interior point methods for semidefinite programming: convergence rates, stability and numerical results, Report 21, New York University Computer Science Department, New York, 1996.
2. C. Helmberg, F. Rendl, R.J. Vanderbei, H. Wolkowicz, An interior point method for semidefinite programming, SIAM J. Optim. 6 (1996) 342-361.
3. M. Kojima, S. Mizuno, A. Yoshise, A primal-dual interior point algorithm for linear programming, in: N. Megiddo (Ed.), Progress in Mathematical Programming: Interior Point and Related Methods, Springer, New York, 1989, pp. 29-37.
4. M. Kojima, N. Megiddo, T. Noma, A. Yoshise, A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Springer, Berlin, 1991.
5. M. Kojima, S. Shindoh, S. Hara, Interior-point methods for the monotone linear complementarity problem in symmetric matrices, SIAM J. Optim. 7 (1) (1997) 86-125.
6. M. Kojima, M. Shida, S. Shindoh, A predictor-corrector interior-point algorithm for the semidefinite linear complementarity problem using the Alizadeh-Haeberley-Overton search direction, Research Reports on Information Sciences, B-311, Dept. of Information Sciences, Tokyo Institute of Technology, 2-12-1 Oh-Okayama, Meguro-ku, Tokyo 152, Japan, 1996.
7. M. Kojima, M. Shida, S. Shindoh, A note on the Nesterov-Todd and the Kojima-Shindoh-Hara search directions in semidefinite programming, Research Reports on Information Sciences, B-313, Dept. of Information Sciences, Tokyo Institute of Technology, 2-12-1 Oh-Okayama, Meguro-ku, Tokyo 152, Japan, 1996.
8. S. Mizuno, M.J. Todd, Y. Ye, On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming, Math. Oper. Res. 18 (4) (1993) 964-981.
9. R.D.C. Monteiro, Primal-dual path following algorithms for semidefinite programming, SIAM J. Optim. 7 (1997) 663-678.
10. R.D.C. Monteiro, Polynomial convergence of primal-dual algorithms for semidefinite programming based on Monteiro and Zhang family of search directions, Technical Report, School of Industrial and Systems Engineering, Georgia Tech, Atlanta, GA, USA, 1996.
11. R.D.C. Monteiro, Y. Zhang, A unified analysis for a class of path-following primal-dual interior point algorithms for semidefinite programming, Working paper (first draft), June 1996.
12. Y. Nesterov, M.J. Todd, Self-scaled barriers and interior-point methods for convex programming, Math. Oper. Res. 22 (1) (1997) 1-42.
13. Y. Nesterov, M.J. Todd, Primal-dual interior-point methods for self-scaled cones, Technical Report 1125, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York, 1995, SIAM J. Optim., to appear.
14. J.F. Sturm, S. Zhang, Symmetric primal-dual path following algorithms for semidefinite programming, Report 9554/A, Econometric Institute, Erasmus University Rotterdam, Rotterdam, The Netherlands, 1995.
15. J.F. Sturm, S. Zhang, On weighted centers for semidefinite programming, Report 9636/A, Econometric Institute, Erasmus University Rotterdam, Rotterdam, The Netherlands, 1996.
16. M.J. Todd, K.C. Toh, R.H. Tütüncü, On the Nesterov-Todd direction in semidefinite programming, Technical Report 1154, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York, 1996.
17. Y. Zhang, On extending primal-dual interior-point algorithms from linear programming to semidefinite programming, Technical Report, Dept. of Mathematics and Statistics, University of Maryland Baltimore County, Baltimore, MD, USA, 1995.