Symmetric primal-dual path-following algorithms for semidefinite programming

Applied Numerical Mathematics

Volumn 29, Issue 3, 1999, Pages 301-315

  Sturm, Jos F ^a,c   Zhang, Shuzhong ^b  

^a TINBERGEN INSTITUTE   (Netherlands)

^b ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^c MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

Primal dual interior point method; Primal dual transformation; Semidefinite programming

Indexed keywords

EID: 0000768180     PISSN: 01689274     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-9274(98)00099-3     Document Type: Article

References (23)

1. F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim. 5 (1995) 13-51.
2. F. Alizadeh, J.A. Heaberly and M. Overton, Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results, Technical Report, Computer Science Department, New York University, New York (1996).
3. A.B. Berkelaar, J.F. Sturm and S. Zhang, Polynomial primal-dual cone affine scaling for semidefinite programming, Report 9667/A, Econometric Institute, Erasmus University, The Netherlands (1996).
4. S. Boyd, L. El Ghaoui, E. Feron and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, Studies in Applied Mathematics 15 (SIAM, Philadelphia, PA, 1994).
5. E. de Klerk, C. Roos and T. Terlaky, Polynomial primal-dual affine scaling algorithms in semidefinite programming, Technical Report 96-42, Faculty of Technical Mathematics and Computer Sciences, Delft University of Technology, The Netherlands (1996).
6. C.C. Gonzaga, Interior path following algorithms, in: J.R. Birge and K.G. Murty, eds., Mathematical Programming, State of the Art 1994 (University of Michigan, Ann Arbor, 1994) 93-101.
7. C.C. Gonzaga, The largest step path following algorithm for monotone linear complementarity problems, Math. Programming 76 (1997) 309-332.
8. C. Helmberg, F. Rendl, R.J. Vanderbei and H. Wolkowicz, An interior-point method for semidefinite programming, SIAM J. Optim. 6 (1996) 342-361.
9. F. Jarre, An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices, SIAM J. Control Optim. 31 (1993) 1360-1377.
10. M. Kojima, S. Mizuno and A. Yoshise, A polynomial algorithm for a class of linear complementarity problems, Math. Programming 44 (1989) 1-26.
11. M. Kojima, N. Megiddo, T. Noma and A. Yoshise, A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems (Springer, Berlin, 1991).
12. M. Kojima, S. Shindoh and S. Hara, Interior-point methods for the monotone linear complementarity problem in symmetric matrices, Research Report on Information Sciences, B-282, Department of Information Sciences, Tokyo Institute of Technology, Tokyo, Japan (1994).
13. S. Mizuno, M.J. Todd and Y. Ye, On adaptive-step primal-dual interior-point algorithms for linear programming, Math. Oper. Res. 18 (4) (1993) 964-981.
14. R.D.C. Monteiro and I. Adler, Interior path following primal-dual algorithms. Part 1: Linear programming, Math. Programming 44 (1989) 27-41.
15. R.D.C. Monteiro, Primal-dual path following algorithms for semidefinite programming, SIAM J. Optim. 7 (1997) 663-678.
16. Y. Nesterov and A. Nemirovsky, Interior Point Polynomial Methods in Convex Programming, Studies in Applied Mathematics 13 (SIAM, Philadelphia, PA, 1994).
17. Y. Nesterov and M.J. Todd, Self-scaled barriers and interior-point methods for convex programming, Math. Oper. Res. 22 (1997) 1-42.
18. Y. Nesterov and M.J. 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. J.F. Sturm, Primal-dual interior point approach to semidefinite programming, Ph.D. Thesis, Tinbergen Institute Research Series 156 (Thesis Publishers, Amsterdam, 1997).
20. J.F. Sturm and S. Zhang, On weighted centers for semidefinite programming, Report 9636/A, Econometric Institute, Erasmus University, The Netherlands (1996).
21. L. Vandenberghe and S. Boyd, A primal-dual potential reduction method for problems involving matrix inequalities, Math. Programming 69 (1995) 205-236.
22. L. Vandenberghe and S. Boyd, Semidefinite programming, SIAM Rev., submitted.
23. Y. Zhang, On extending primal-dual interior-point algorithms from linear programming to semidefinite programming, Technical Report, Department of Mathematics and Statistics, University of Maryland, Baltimore County, Baltimore, MD (1995).