A superlinearly convergent primal-dual infeasible-interior-point algorithm for semidefinite programming

SIAM Journal on Optimization

Volumn 8, Issue 4, 1998, Pages 1007-1028

  Potra, Florian A ^a   Sheng, Rongqin ^a  

^a UNIVERSITY OF IOWA   (United States)

Author keywords

Infeasible interior point algorithm; Path following; Polynomiality; Semidefinite programming; Superlinear convergence

Indexed keywords

EID: 0032327344     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623495294955     Document Type: Article

References (17)

1. F. ALIZADEH, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim., 5 (1995), pp. 13-51.
2. F. ALIZADEH, J.-P. A. HAEBERLY, AND M. L. OVERTON, Primal-dual interior point methods for semidefinite programming, SIAM J. Optim., 8 (1998), pp. 746-768.
3. F. ALIZADEH, J.-P. A. HAEBERLY, AND M. L. OVERTON, Complementarity and nondegeneracy in semidefinite programming, Math. Programming, 77 (1997), pp. 111-128.
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. R. A. HORN AND C. R. JOHNSON, Matrix Analysis, Cambridge University Press, New York, 1985.
6. J. JI, F. A. POTRA, AND S. HUANG, A predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence, J. Optim. Theory Appl., 84 (1995), pp. 187-199.
7. M. KOJIMA, S. KOJIMA, AND S. HARA, Linear Algebra for Semidefinite Programming, Research Reports on Information Sciences B-290, Department of Information Sciences, Tokyo Institute of Technology, 2-12-1 Oh-Okayama, Meguro-ku, Tokyo 152, Japan, 1994.
8. M. KOJIMA, M. SHIDA, AND S. SHINDOH, Global and Local Convergence of Predictor-Corrector Infeasible-Interior-Point Algorithms for Semidefinite Programs, Research Reports on Information Sciences B-305, Department of Information Sciences, Tokyo Institute of Technology, 2-12-1 Oh-Okayama, Meguro-ku, Tokyo 152, Japan, 1995.
9. 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.
10. S. MIZUNO, F. JARRE, AND J. STOER, A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems, Appl. Math. Optim., 33 (1996), pp. 315-341.
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. Y. E. NESTEROV AND M. J. TODD, Primal-dual interior-point methods for self-scaled cones, SIAM J. Optim., 8 (1998), pp. 324-364.
14. M. L. OVERTON, private communication.
15. R. SHENG AND F. A. POTRA, A quadratically convergent infeasible-interior-point algorithm for LCP with polynomial complexity, SIAM J. Optim., 7 (1997), pp. 304-317.
16. L. VANDENBERGHE AND S. BOYD, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95.
17. Y. ZHANG, On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming, SIAM J. Optim., 8 (1998), pp. 365-386.