Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming

SIAM Journal on Optimization

Volumn 8, Issue 1, 1998, Pages 59-81

  Luo, Zhi Quan ^a   Sturm, Jos F ^b   Zhang, Shuzhong ^b  

^a MCMASTER UNIVERSITY   (Canada)

^b ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

Author keywords

Central path; Path following; Semidefinite programming; Superlinear convergence

Indexed keywords

EID: 0032345991     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623496299187     Document Type: Article

References (21)

1. F. ALIZADEH, Interior point methods in semidefinite programming with applications to combinatorial optimization problems, SIAM J. Optim., 5 (1995), pp. 13-51.
2. 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), to appear.
3. O. GÜLER, Limiting behavior of weighted central paths in linear programming, Math. Programming, 65 (1994), pp. 347-363.
4. 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.
5. A. J. HOFFMAN, On approximate solutions of systems of linear inequalities, J. Res. National Bureau of Standards, 49 (1952), pp. 263-265.
6. M. KOJIMA, N. MEGIDDO, T. NOMA, AND A. YOSHISE, A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Springer-Verlag, Berlin, 1991.
7. M. KOJIMA, M. SHIDA, AND S. SHINDOH, Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs, Research Reports on Information Sciences, B-306, Department of Information Sciences, Tokyo Institute of Technology, 2-12-1 Oh-Okayama, Meguro-ku, Tokyo 152, Japan, 1995.
8. 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.
9. C. J. LIN AND R. SAIGAL, An Infeasible Start Predictor Corrector Method for Semi-Definite Linear Programming, Tech. report, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI, 1995.
10. N. MEGIDDO, Pathways to the optimal solution set in linear programming, in Progress in Mathematical Programming, Interior-Point and Related Methods, N. Megiddo, ed., Springer-Verlag, New York, 1989, pp. 131-158.
11. 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. 964-981.
12. R. D. C. MONTEIRO, Primal-dual path-following algorithms for semidefinite programming, SIAM J. Optim., 7 (1997), pp. 663-678.
13. R. D. C. MONTEIRO AND T. TSUCHIYA, Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem, Math. Oper. Res., 21 (1996), pp. 793-814.
14. Y. NESTEROV AND M. J. TODD, Self-scaled barriers and interior-point methods for convex programming, Math. Oper. Res., 22 (1997), pp. 1-42.
15. Y. NESTEROV AND M. J. TODD, Primal-dual interior-point methods for self-scaled cones, Tech. report 1125, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1995.
16. F. A. POTRA AND R. SHENG, A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming, Report on Computational Mathematics 78, Department of Mathematics, University of Iowa, Iowa City. IA, 1995.
17. 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.
18. L. VANDENBERGHE AND S. BOYD, A primal-dual potential reduction method for problems involving matrix inequalities, Math. Programming, 69 (1995), pp. 205-236.
19. L. VANDENBERGHE AND S. BOYD, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95.
20. Y. YE AND K. ANSTREICHER, On quadratic and O(√nL) convergence of a predictor-corrector algorithm for LCP, Math. Programming, 62 (1993), pp. 537-551.
21. Y. ZHANG, On extending primal-dual interior-point algorithms from linear programming to semidefinite programming, SIAM J. Optim., 8 (1998), to appear.