Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming

Mathematical Programming

Volumn 99, Issue 2, 2004, Pages 261-282

  Zhou, Guanglu ^a   Toh, Kim Chuan ^b  

^a SINGAPORE MIT ALLIANCE   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Inexact search direction; Infeasible interior point method; Polynomial complexity; Primal dual; Semidefinite programming

Indexed keywords

INEXACT SEARCH DIRECTION; INFEASIBLE INTERIOR POINT METHOD; POLYNOMIAL COMPLEXITY; PRIMAL-DUAL; SEMIDEFINITE PROGRAMMING;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; SET THEORY; THEOREM PROVING;

STOCHASTIC PROGRAMMING;

EID: 5544283225     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-003-0431-5     Document Type: Article

References (24)

1. Freund, R.W., Jarre, F., Mizuno, S.: Convergence of a class of inexact interior point algorithms for linear programs. Math. Oper. Res. 24, 50-71 (1999)
2. Helmberg, C., Rendl, F., Vanderbei, R., Wolkowicz, H.: An interior-point method for semidefinite programming. SIAM J. Optim. 6, 342-361 (1996)
3. Horn, R.A., Johnson, C.R.: Topics in matrix analysis. Cambridge University Press, New York, NY, 1991
4. Gu, M.: Primal-dual interior-point methods for semidefinite programming in finite precision. SIAM J. Optim. 10, 462-502 (2000)
5. Kojima, M., Shindoh, S., Hara, S.: Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM J. Optim. 7, 86-125 (1997)
6. Kojima, M., Shida, M., Shindoh, S.: Search directions in the SDP and the monotone SDLCP: generalization and inexact computation. Math. Program. 85, 51-80 (1999)
7. Korzak, J.: Convergence analysis of inexact infeasible-interior-point algorithms for solving linear programming problems. SIAM J. Optim. 11, 133-148 (2000)
8. Mizuno, S.: Polynomiality of infeasible interior point method for linear programming. Math. Program. 67, 52-67 (1994)
9. Mizuno, S., Jarre, F.: Global and polynomial-time convergence of an infeasible interior point algorithm using inexact computation. Math. Program. 84, 105-122 (1999)
10. Monteiro, R.D.C.: Primal-dual path following algorithms for semidefinite programming. SIAM J. Optim. 7, 663-678 (1997)
11. Monteiro, R.D.C., Tsuchiya, T.: Polynomial convergence of a new family of primal-dual algorithms for semidefinite programming. SIAM J. Optim. 9, 551-577 (1999)
12. Monteiro, R.D.C., Zhang, Y.: A unified analysis for a class of path-following primal-dual interior-point algorithms for semidefinite programming. Math. Program. 81, 281-299 (1998)
13. Parlett, B.N.: The symmetric eigenvalue problem. Prentice-Hall, Englewood Cliffs, New Jersey, 1980
14. Stoer, J., Bulirsch, R.: Introduction to numerical analysis. 2nd edition, Springer-Verlag, New York, 1993
15. Todd, M.J.: On search directions in interior-point methods for semidefinite programming. Optim. Methods Softw. 11, 1-46 (1999)
16. Todd, M.J.: Semidefinite optimization. Acta Numerica 10, 515-560 (2001)
17. Todd, M.J., Toh, K.C., Tütüncü, R.H.: On the nesterov-todd direction in semidefinite programming. SIAM J. Optim. 8, 769-796 (1998)
18. Toh, K.C., Kojima, M.: Solving some large scale semidefinite programs via the conjugate residual method. SIAM J. Optim. 12, 669-691 (2002)
19. Toh, K.C.: Solving large scale semidefinite programs via an iterative solver on the augmented systems. Talk delivered at the seventh SIAM Conference on Optimization, Toronto, 2002
20. Wolkowicz, H.: Bibliography on semidefinite programming, http://liinwww.ira.uka.de/bibliography/Math/psd.html.
21. Wolkowicz, H., Saigal, R., Vandenberghe, L.: Handbook of semidefinite programming. Kluwer Academic Publishers, Boston-Dordrecht-London, 2000
22. Rui, Y.: Polynomial convergence of inexact interior point algorithms for semidefinite programming. Master Thesis, Department of Mathematics, National University of Singapore, 2002
23. Zhang, Y.: On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem. SIAM J. Optim. 4, 208-227 (1994)
24. Zhang, Y.: On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8, 365-386 (1998)