Polynomial primal-dual cone affine scaling for semidefinite programming

Applied Numerical Mathematics

Volumn 29, Issue 3, 1999, Pages 317-333

  Berkelaar, Arjan B ^a   Sturm, Jos F ^a,b   Zhang, Shuzhong ^a  

^a ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^b MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

Affine scaling; Primal dual interior point methods; Semidefinite programming

Indexed keywords

EID: 0040437615     PISSN: 01689274     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-9274(98)00100-7     Document Type: Article

References (35)

1. F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization problems, SIAM J. Optim. 5 (1995) 13-51.
2. F. Alizadeh, J.A. Haeberly and M. Overton, Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results, Technical Report 721, Computer Science Department, New York University, New York (1996).
3. E.R. Barnes, A variation on Karmarkar's algorithm for solving linear programming problems, Math. Programming 36 (1986) 174-182.
4. I.I. Dikin, Iterative solution of problems of linear and quadratic programming, Dokl. Akad. Nauk SSSR 174 (1967) 747-748; translated in Soviet Math. Dokl. 8 (1967) 674-675.
5. I.I. Dikin, Iterative solution of problems of linear and quadratic programming, Dokl. Akad. Nauk SSSR 174 (1967) 747-748; translated in Soviet Math. Dokl. 8 (1967) 674-675.
6. I.I. Dikin, Letter to the editor, Math. Programming 41 (1988) 393-394.
7. D. Goldfarb and D. Xiao, A primal projective interior point method for linear programming, Math. Programming 51 (1991) 17-43.
8. C.C. Gonzaga, Conical projection algorithms for linear programming, Math. Programming 43 (1989) 151-173.
9. C. Helmberg, F. Rendl, R.J. Vanderbei and H. Wolkowicz, An interior-point method for semidefinite programming, SIAM J. Optim. 6 (1996) 342-361.
10. [9 ] G.M. Jan and S.C. Fang, A new variant of the primal affine scaling method for linear programs, Optim. 22 (5) (1991) 681-715.
11. B. Jansen, Interior Point Techniques in Optimization. Complexity, Sensitivity and Algorithms (Kluwer Academic, Dordrecht, 1997).
12. B. Jansen, C. Roos and T. Terlaky, A polynomial Dikin-type primal-dual algorithm for linear programming, Math. Oper. Res. 21 (1994) 225-233.
13. B. Jansen, C. Roos, T. Terlaky and Y. Ye, Improved complexity using higher-order correctors for primal-dual Dikin affine scaling, Math. Programming 76 (1997) 117-130.
14. N.K. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984) 373-395.
15. E. de Klerk, C. Roos and T. Terlaky, Polynomial primal-dual affine scaling algorithms in semidefinite programming, J. Combin. Optim. 2 (1997) 47-68.
16. M. Kojima, S. Shindoh and S. Hara, Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices, SIAM J. Optim. 1 (1) (1997) 86-125.
17. C.J. Lin and R. Saigal, An infeasible start predictor corrector method for semi-definite linear programming, Technical Report, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI (1995).
18. R.D.C. Monteiro, Primal-dual path following algorithms for semidefinite programming, SIAM J. Optim. 7 (3) (1997).
19. R.D.C. Monteiro, I. Adler and M.G.C. Resende, A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension, Math. Oper.Res. 15 (1990) 191-214.
20. M. Muramatsu, Affine scaling algorithm fails for semidefinite programming, Technical Report 16, Department of Mechanical Engineering, Sophia University, Japan (1996).
21. M. Muramatsu and R.J. Vanderbei, Primal-dual affine-scaling algorithms fail for semidefinite programming, Technical Report, Department of Mechanical Engineering, Sophia University, Japan (1997).
22. 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).
23. Y. Nesterov and M.J. Todd, Self-scaled barriers and interior-point methods for convex programming, Math. Oper. Res. 22 (1) (1997) 1-42.
24. M.W. Padberg, Solution of a nonlinear programming problem arising in the projective method for linear programming, Technical Report, School of Business and Administration, New York University, New York (March 1985).
25. F.A. Potra and R. Sheng, Homogeneous interior-point algorithms for semidefinite programming, Technical Report, Department of Mathematics, University of IOWA, Iowa City, IA (1995).
26. J.F. Sturm, Primal-Dual Interior Point Approach to Semidefinite Programming, Tinbergen Institute Research Series, Vol. 156 (Thesis Publishers, Amsterdam, 1997).
27. J.F. Sturm and S. Zhang, Symmetric primal-dual path-following algorithms for semidefinite programming, Technical Report 9554/A, Econometric Institute, Erasmus University Rotterdam, The Netherlands (1995); also: Appl. Numer. Math. 29 (1999) 301-315 (this issue).
28. J.F. Sturm and S. Zhang, Symmetric primal-dual path-following algorithms for semidefinite programming, Technical Report 9554/A, Econometric Institute, Erasmus University Rotterdam, The Netherlands (1995); also: Appl. Numer. Math. 29 (1999) 301-315 (this issue).
29. J.F. Sturm and S. Zhang, On weighted centers for semidefinite programming, Technical Report 9636/A, Econometric Institute, Erasmus University Rotterdam, The Netherlands (1996).
30. J.F. Sturm and S. Zhang, An O(√nL) iteration bound primal-dual cone affine scaling algorithm for linear programming, Math. Programming 72 (1996) 177-194.
31. M.J. Todd, On search directions in interior-point methods for semidefinite programming, Technical Report, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY (1997).
32. M.J. Todd, K.C. Toh and R.H. Tütüncü, On the Nesterov-Todd direction in semidefinite programming, Technical Report TR 1154, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY (1996).
33. L. Vandenberghe and S. Boyd, Semidefinite programming, SIAM Rev. 38 (1996) 49-95.
34. R.J. Vanderbei, M.S. Meketon and B.A. Freedman, A modification of Karmarkar's linear programming algorithm, Algorithmica 1 (4) (1986) 395-407.
35. 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).