Primal-dual path-following algorithms for semidefinite programming

SIAM Journal on Optimization

Volumn 7, Issue 3, 1997, Pages 663-678

  Monteiro, Renato D C ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Interior point methods; Path following methods; Polynomial complexity; Primal dual algorithms; Semidefinite programming

Indexed keywords

EID: 0031285899     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623495293056     Document Type: Article

References (21)

1. I. ADLER AND F. ALIZADEH, Primal-Ddual Interior Point Algorithms for Convex Quadratically Constrained and Semidefinite Optimization Problems, manuscript.
2. F. ALIZADEH, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim. 5 (1995), pp. 13-51.
3. F. ALIZADEH, J.-P. A. HAEBERLY, AND M. L. OVERTON, Primal-Dual Interior-Point Methods for Semidefinite Programming, manuscript. Presented at the Math Programming Symposium, Ann Arbor, MI, 1994.
4. G. H. GOLUB AND C. E. VAN LOAN, Matrix Computations: Second Edition, The John Hopkins University Press, Baltimore, MD, 1989.
5. 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.
6. R. A. HORN AND C. R. JOHNSON, Matrix Analysis, Cambridge University Press, New York, 1985.
7. R. A. HORN AND C. R. JOHNSON, Topics in Matrix Analysis, Cambridge University Press, New York, 1991.
8. F. JARRE, An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices, SIAM J. Optim., 31 (1993), pp. 1360-1377.
9. M. KOJIMA, S. MIZUNO, AND A. YOSHISE, A polynomial-time algorithm for a class of linear complementarity problems, Math. Programming, 44 (1989), pp. 1-26.
10. M. KOJIMA, S. MIZUNO, AND A. YOSHISE, A primal-dual interior point algorithm for linear programming, in Progress in Mathematical Programming: Interior Point and Related Methods, N. Megiddo, ed., Springer-Verlag, Berlin, New York, 1989, pp. 29-47.
11. 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.
12. R. D. C. MONTEIRO AND I. ADLER, Interior path-following primal-dual algorithms. Part I: Linear programming, Math. Programming, 44 (1989), pp. 27-41.
13. R. D. C. MONTEIRO AND I. ADLER, Interior path-following primal-dual algorithms. Part II: Convex quadratic programming, Math. Programming, 44 (1989), pp. 43-66.
14. Y. E. NESTEROV AND A. S. NEMIROVSKII, A general approach to the design of optimal methods for smooth convex functions minimization, Ekonomika i Matem. Metody, 24 (1988), pp. 509-517 (in Russian).
15. Y. E. NESTEROV AND A. S. NEMIROVSKII, Self-Concordant Functions and Polynomial Time Methods in Convex Programming, Central Economic & Mathematical Institute, USSR Acad. Sci. Moscow, USSR, 1989, preprint.
16. Y. E. NESTEROV AND A. S. NEMIROVSKII, Optimization Over Positive Semidefinite Matrices: Mathematical Background and User's Manual, Technical report, Central Economic & Mathematical Institute, USSR Acad. Sci. Moscow, USSR, 1990.
17. Y. E. NESTEROV AND A. S. NEMIROVSKII, Interior Point Methods in Convex Programming: Theory and Applications, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1994.
18. Y. E. NESTEROV AND M. TODD, Primal-Dual Interior-Point Methods for Self-Scaled Cones, Technical report 1125, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1995.
19. Y. E. NESTEROV AND M. TODD, Self-scaled barriers and interior-point methods for convex programming, Math. Oper. Res., 22 (1997), pp. 1-42.
20. L. VANDENBERGHE AND S. BOYD, A primal-dual potential reduction method for problems involving matrix inequalities, Math. Programming, 69 (1995), pp. 205-236.
21. Y. YE, A class of protective transformations for linear programming, SIAM J. Comput., 19 (1990), pp. 457-466.