Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs

Mathematical Programming, Series B

Volumn 80, Issue 2, 1998, Pages 129-160

  Kojima, Masakazu ^a   Shida, Masayuki ^b   Shindoh, Susumu ^c  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b KANAGAWA UNIVERSITY   (Japan)

^c NATIONAL DEFENSE ACADEMY   (Japan)

Author keywords

Infeasible interior point method; Predictor corrector method; Primal dual nondegeneracy; Semidefinite programming; Superlinear convergence

Indexed keywords

EID: 0000376618     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01581723     Document Type: Article

References (34)

1. C. Helmberg, F. Rendl, R.J. Vanderbei, H. Wolkowicz, An interior-point method for semidefinite programming, SIAM Journal on Optimization 6 (1996) 342-361.
2. M. Kojima, S. Shindoh, S. Hara, Interior-point methods for the monotone semidefinite linear complementarity problems, SIAM Journal on Optimization 7 (1997) 86-125.
3. F. Alizadeh, Interior point methods in semidefinite programming with application to combinatorial optimization, SIAM Journal on Optimization 5 (1995) 13-51.
4. F. Alizadeh, J.-P.A. Haeberly, M.L. Overton, Primal-dual interior-point methods for semidefinite programming, Working Paper, 1994.
5. R.M. Freund, Complexity of an Algorithm for Finding an Approximate Solution of a Semidefinite Program with no Regularity Assumption, Technical report OR 302-94, Operations Research Center, MIT press, Cambridge, MA, 1994.
6. F. Jarre, An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices, SIAM Journal on Control and Optimization 31 (1993) 1360-1377.
7. Yu.E. Nesterov, A.S. Nemirovskii, Interior Point Polynomial Methods in Convex Programming: Theory and Applications, SIAM, Philadelphia, 1993.
8. L. Vandenberghe, S. Boyd, A primal-dual potential reduction method for problems involving matrix inequalities, Mathematical Programming 69 (1995) 205-236.
9. L. Vandenberghe, S. Boyd, Semidefinite Programming, SIAM Review 38 (1996) 49-95.
10. M. Kojima, S. Mizuno, A. Yoshise, A polynomial-time algorithm for a class of linear complementary problems, Mathematical Programming 44 (1989) 1-26.
11. R.D.C. Monteiro, I. Adler, Interior Path-Following Primal-Dual Algorithm, Part I: Linear Programming, Mathematical Programming 44 (1989) 27-41.
12. M. Kojima, S. Mizuno, A. Yoshise, An o(√nL) iteration potential reduction algorithm for linear complementarity problems, Mathematical Programming 50 (1991) 331-342.
13. S. Mizuno, M. Kojima, M.J. Todd, Infeasible-interior-point primal-dual potential-reduction algorithms for linear programming, SIAM Journal on Optimization 5 (1995) 52-67.
14. R.D.C. Monteiro, Primal-Dual Path Following Algorithms for Semidefinite Programming, SIAM Journal on Optimization (to appear).
15. 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, Berlin, 1989, pp. 29-47.
16. Y. Zhang, On Extending Primal-Dual Interior-Point Algorithms from Linear Programming to Semidefinite Programming, SIAM Journal on Optimization (to appear).
17. Y. Zhang, On the convergence of a class of infeasible interior-point algorithms for the horizontal linear complementarity problem, SIAM Journal on Optimization 4 (1994) 208-227.
18. F.A. Potra, R. Sheng, A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming, Department of Mathematics, University of Iowa, Iowa City, IA 52242, October 1995.
19. S. Mizuno, M.J. Todd, Y. Ye, On adaptive-step primal-dual interior-point algorithms for linear programming, Mathematics of Operations Research 18 (1993) 964-981.
20. C.-J. Lin, R. Saigal, A predictor-corrector method for semi-definite linear programming, Working paper, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, Michigan 48109-2117, October 1995.
21. M. Kojima, M. Shida, S. Shindoh, Global and local convergence of predictor-corrector infeasible-interior-point algorithms for semidefinite programs, Research Report #305, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro, Tokyo 152, Japan, October 1995.
22. F. Alizadeh, J.-P.A. Haeberly, M.L. Overton, Complementarity and nondegeneracy in semidefinite programming, Working Paper, 1995.
23. K. Fujisawa, M. Kojima, K. Nakata, SDPA (Semidefinite Programming Algorithm) - User's Manual - Technical Report B-308, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro, Tokyo 152, Japan, December 1995, Revised August 1996.
24. M. Kojima, A primitive interior point algorithm for semidefinite programs in Mathematica, Technical Report B-293, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro, Tokyo 152, Japan, December 1994.
25. J.-P.A. Haeberly, Private communication, February 1996.
26. S. Mizuno, A superlinearly convergent infeasible-interior-point algorithm for geometrical LCPs without a strictly complementarity condition, Mathematics of Operations Research 21 (1996) 382-400.
27. Y. Ye, K. Anstreicher, On quadratic and o(√nL) convergence of a predictor-corrector algorithm for LCP, Mathematical Programming 62 (1993) 537-551.
28. R.D.C. Monteiro, S.J. Wright, Local convergence of interior-point algorithms for degenerate monotone LCP, Computational Optimization and Applications 3 (1994) 131-155.
29. Yu.E. Nesterov, M.J. Todd, Self-Scaled Cones and Interior-Point Methods in Nonlinear Programming, Working Paper, CORE, Catholic University of Louvain, Louvain-la-Neuve, Belgium, April 1994.
30. Yu.E. Nesterov, M.J. Todd, Primal-dual interior-point methods for self-scaled cones, SIAM Journal on Optimization (to appear).
31. F.A. Potra, R. Sheng, Superlinear convergence of infeasible-interior-point algorithms for semidefinite programming, Department of Mathematics, University of Iowa, Iowa City, IA 52242, April 1996.
32. Z.-Q. Luo, J.S. Sturm, S. Zhang, Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming, SIAM Journal on Optimization (to appear).
33. M. Kojima, M. Shida, S. Shindoh, A predictor-corrector interior-point algorithm for the semidefinite linear complementarity problem using the Alizadeh-Haeberly-Overton search direction, Research Report #311, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro, Tokyo 152, Japan, December 1996.
34. F. Alizadeh, J.-P.A. Haeberly, M.L. Overton, Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results, SlAM Journal On Optimization (to appear).