Superlinear convergence of interior-point algorithms for semidefinite programming

Journal of Optimization Theory and Applications

Volumn 99, Issue 1, 1998, Pages 103-119

  Potra, F A ^a   Sheng, R ^b  

^a UNIVERSITY OF IOWA   (United States)

^b ARGONNE NATIONAL LABORATORY   (United States)

Author keywords

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

Indexed keywords

CONDITION; INFEASIBLE INTERIOR-POINT ALGORITHM; INFEASIBLE INTERIOR-POINT-PATHS; INTERIOR POINT ALGORITHM; PATH-FOLLOWING ALGORITHM; POLYNOMIALITY; PRIMAL-DUAL; SEMI-DEFINITE PROGRAMMING; STRICT COMPLEMENTARITY; SUPERLINEAR CONVERGENCE;

EID: 0039990267     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021700210959     Document Type: Article

References (15)

1. ALIZADEH, F., HAEBERLY, J. P. A., and OVERTON, M. L., Primal-Dual Interior Point Methods for Semidefinite Programming, Working Paper, 1994.
2. HELMBERG, C., RENDL, F., VANDERBEI, R. J., and WOLKOWICZ, H., An Interior-Point Method for Semidefinite Programming, Technical Report, Program in Statistics and Operations Research, Princeton University, 1994.
3. KOJIMA, M., SHIDA, M., and SHINDOH, S., Global and Local Convergence of Predictor-Corrector Infeasible-Interior-Point Algorithms for Semidefinite Programs, Information Sciences Research Report B-305, Department of Information Sciences, Tokyo Institute of Technology, Tokyo, Japan, 1995.
4. KOJIMA, M., SHIDA, M., and SHINDOH, S., Local Convergence of Predictor-Corrector Infeasible-Interior-Point Algorithms for Semidefinite Programs, Information Sciences Research Report B-306, Department of Information Sciences, Tokyo Institute of Technology, Tokyo, Japan, 1995.
5. KOJIMA, M., SHIDA, M., and SHINDOH, S., A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh-Haeberly-Overton Search Direction, Information Sciences Research Report B-311. Department of Information Sciences, Tokyo Institute of Technology, Tokyo, Japan, 1996.
6. KOJIMA, M., SHINDOH, S., and HARA, S., Interior-Point Methods for the Monotone Linear Complementarity Problem in Symmetric Matrices, Information Sciences Research Report B-282, Department of Information Sciences, Tokyo Institute of Technology, Tokyo, Japan, 1994.
7. LUO, Z. Q., STURM, J. F., and ZHANG, S., Superlinear Convergence of a Symmetric Primal-Dual Path-Following Algorithm for Semidefinite Programming, Report 9607/A, Econometric Institute, Erasmus University Rotterdam, Rotterdam, Netherlands, 1996.
8. MONTEIRO, R. D. C., Primal-Dual Path-Following Algorithms for Semidefinite Programming. Working Paper, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia, 1995.
9. NESTEROV, Y. E., and TODD, M. J., 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.
10. POTRA, F. A., and SHENG, R., Homogeneous Interior-Point Algorithms for Semidefinite Programming, Computational Mathematics Report 82, Department of Mathematics, University of Iowa, Iowa City, Iowa, 1995.
11. POTRA, F. A., and SHENG, R., A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming, Computational Mathematics Report 78, Department of Mathematics, University of Iowa, Iowa City, Iowa, 1995.
12. STURM, J. F., and ZHANG, S., Symmetric Primal-Dual Path-Following Algorithms for Semidefinite Programming, Report 9554/A, Econometric Institute, Erasmus University Rotterdam, Rotterdam, Netherlands, 1995.
13. VANDENBERGHE, L., and BOYD, S., Semidefinite Programming, SIAM Review, Vol. 38, pp. 49-95, 1996.
14. ZHANG, Y., On Extending Primal-Dual Interior-Point Algorithms for Linear Programming to Semidefinite Programming, TR 95-20, Department of Mathematics and Statistics, University of Maryland Baltimore County, Baltimore, Maryland, 1995.
15. MIZUNO, S., TODD, M. J., and YE, Y., On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming, Mathematics of Operations Research, Vol. 18, pp. 964-981, 1993.