On homogeneous interior-point algorithms for semidefinite programming

Optimization Methods and Software

Volumn 9, Issue 1-3, 1998, Pages 161-184

  Potra, Florian A ^a   Sheng, Rongqin ^b  

^a UNIVERSITY OF IOWA   (United States)

^b ARGONNE NATIONAL LABORATORY   (United States)

Author keywords

Homogeneous interior point algorithm; Polynomial complexity; Semidefinite programming

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; POLYNOMIALS;

HOMOGENEOUS INTERIOR POINT ALGORITHMS; SEMIDEFINITE PROGRAMMING;

MATHEMATICAL PROGRAMMING;

EID: 0031698662     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789808805691     Document Type: Article

References (24)

1. Alizadeh, F., Haeberly, J.-P. A. and Overton, M, L. (1994). Primal-dual interior point methods for semidefinite programming. Technical Report 659, Computer Science Department, Courant Institute of Mathematical Sciences, New York University.
2. Brixius, N., Potra, F. A. and Sheng, R. (1996). Solving semidefinite programs in mathematica. Reports on Computational Mathematics 97, Department of Mathematics, The University of Iowa, Iowa City, IA 52242, USA, November.
3. De Klerk, E., Roos, C. and Terlaky, T. (1996). Initialization in semidefinite programming via a self-dual skew-symmetric embedding. Report 96-10, Faculty of Technical Mathematics and Computer Science, Delft University of Technology, Delft, The Netherlands.
4. De Klerk, E., Roos, C. and Terlaky, T. (1997). Infeasible start semidefinite programming algorithms via self-dual embeddings. Report 97-10, Faculty of Technical Mathematics and Computer Science, Delft University of Technology, Delft, The Netherlands.
5. Goldman, A. J. and Tucker, A. W. (1956). Polyhedral convex cones. In H. W. Kuhn and A. W. Tucker, editors, Linear Inequalities and Related Systems. Princeton University Press, Princeton, NJ, p. 19.
6. Helmberg, C., Rendl, F., Vanderbei, R. J. and Wolkowicz, H. (1996). An interior-point method for semidefinite programming. SIAM J. Optimization, 6(2), 342.
7. Kojima, M., Mizuno, S. and Yoshise, A. (1989). A primal-dual interior point algorithm for linear programming. In N. Megiddo, editor, Progress in Mathematical Programming, Springer Verlag, New York, pages 29-47.
8. Kojima, M., Shida, M. and Shindoh, S. (1995). 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, October.
9. Kojima, M., Shida, M. and Shindoh, S. (1996). A predictor-corrector interior-point algorithm for the semidefinite linear complementarity problem using the Alizadeh-Haeberly-Overton search direction. Research Reports on Information Sciences B-311, Department of Information Sciences, Tokyo Institute of Technology, 2-12-1 Oh-Okayama, Meguro-ku, Tokyo 152, Japan, January.
10. Kojima, M., Shindoh, S. and Hara, S. (1994). Interior-point methods for the monotone linear complementarity problem in symmetric matrices. Research Reports on Information Sciences B-282, Department of Information Sciences, Tokyo Institute of Technology, 2-12-1 Oh-Okayama, Meguro-ku, Tokyo 152, Japan, April.
11. Monteiro, R. D. C. (1995). Primal-dual path following algorithms for semidefinite programming. Working paper, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA, September.
12. Monteiro, R. D. C. and Zhang, Y. (1996). A unified analysis for a class of path-following primal-dual interior-point algorithms for semidefinite programming. Working paper, School of Industrial and Systems Engineering, Georgia Institute of Technology, June.
13. Nesterov, Y, E. (1993). Long-step strategies in interior point potential-reduction methods. Working paper, Department SES COMIN, Geneva University, to appear in Mathematical Programming.
14. Nesterov, Y, E. (1994). Infeasible start interior point primal-dual methods in non-linear programming. Working paper, Center for Operations Research and Econometrics, 1348 Louvain-la-Neuve, Belgium.
15. Nesterov, Y. E. and Todd, M, J. (1995). Primal-dual interior-point methods for self-scaled cones. Technical Report 1125, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York 14853-3801, USA.
16. Potra, F. A. and Sheng, R. (1995). Homogeneous interior-point algorithms for semi-definite programming. Reports on Computational Mathematics 82, Department of Mathematics, The University of Iowa, Iowa City, IA 52242, USA, November.
17. Potra, F. A. and Sheng, R. (1995). A superlinearly convergent primal-dual infeasible-interior-point algorithm for semidefinite programming. Reports on Computational Mathematics 78, Department of Mathematics, The University of Iowa, Iowa City, IA 52242, USA, October, (to appear in SIAM Journal on Optimization).
18. Potra, F. A., Sheng, R. and Brixius, N. (1997). SDPHA- a MATLAB implementation of homogeneous interior-point algorithms for semidefinite programming. Reports on Computational Mathematics 100, Department of Mathematics, The University of Iowa, Iowa City, IA 52242, USA, April.
19. Todd, M. J., Toh, K. C. and Tütüncü, R. H. (1996). On the Nesterov-Todd direction in semidefinite programming. Technical Report, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY 14853-3801, USA.
20. Toh, K. C., Todd, M. J. and Tütüncü, R. H. (1996). SDPT3 - a Matlab software package for semidefinite programming. Manuscript, December.
21. Tucker, A, W. (1956). Dual systems of homogeneous relations. In H. W. Kuhn and A. W. Tucker, editors, Linear Inequalities and Related Systems. Princeton University Press, Princeton, NJ. p. 3.
22. Xu, X., Hung, P. and Ye, Y. (1993). A simplification of the homogeneous and self-dual linear programming algorithm and its implementation. Working paper, Department of Management Sciences, The University of Iowa, Iowa City, Iowa 52242, USA, to appear in Annals of Operations Research.
23. Ye, Y., Todd, M. J. and Mizuno, S. (1994). An O(√n L)-iteration homogeneous and self-dual linear programming algorithm. Mathematics of Operations Research, 19(1), 53.
24. Zhang, Y. (1995). On extending primal-dual interior-point algorithms from linear programming to semidefinite programming. TR 95-20, Department of Mathematics and Statistics, University of Maryland Baltimore County, Baltimore, Maryland 21228-5398, USA, October.