Interior point trajectories in semidefinite programming

SIAM Journal on Optimization

Volumn 8, Issue 4, 1998, Pages 871-886

  Goldfarb, D ^a   Scheinberg, K ^b  

^a Columbia University ^*  (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Central path; Interior point methods; Semidefinite programming

Indexed keywords

EID: 0032332553     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S105262349630009X     Document Type: Article

References (32)

1. I. ADLER AND R. D. C. MONTEIRO, Limiting behavior of the affine scaling continuous trajectories for linear programming problems, Math. Programming, 50 (1991), pp. 29-51.
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, Complementarity and nondegeneracy in semidefinite programming, Math. Programming, 77 (1997), pp. 111-128.
4. F. ALIZADEH, J.-P. A. HAEBERLY, AND M. L. OVERTON, Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results, SIAM J. Optim., 8 (1998), pp. 746-768.
5. G. PH. BARKER AND D. CARLSON, Cones of diagonally dominant matrices, Pacific J. Math., 57 (1975), pp. 15-32.
6. D. A. BAYER AND J. C. LAGARIAS, The nonlinear geometry of linear programming. I. Affine and projective scaling trajectories, Trans. Amer. Math. Soc., 314 (1989), pp. 499-526.
7. L. FAYBUSOVICH, On a matrix generalization of affine-scaling vector fields, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 886-897.
8. L. FAYBUSOVICH, A Hamiltonian structure of generalized affine scaling vector fields, J. Nonlinear Sci., 5 (1995), pp. 11-28.
9. A. GRAHAM, Kronecker Products and Matrix Calculus: With Applications, Ellis Horwood, London, UK, 1981.
10. O. GÜLER, Existence of interior points and interior paths in nonlinear monotone complementarity problems, Math. Oper. Res., 18 (1993). pp. 128-147.
11. C. HELMBERG, F. RENDL, R. VANDERBEI, AND H. WOLKOWICZ, An interior-point method for semidefinite programming, SIAM J. Optim., 6 (1996), pp. 342-361.
12. T. KATO, A Short Introduction to Perturbation Theory for Linear Operators, Springer-Verlag, New York, 1982.
13. M. KOJIMA, S. MIZUNO, AND T. NOMA, Limiting behavior of trajectories generated by a continuation method for monotone complementarity problems, Math. Oper. Res., 15 (1990), pp. 662-675.
14. M. KOJIMA, M. SHIDA, AND S. SHINDOH, Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs, Math. Programming, 80 (1998), pp. 129-160.
15. 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.
16. Z.-Q. LUO, J. STURM, AND S. ZHANG, Superlinear Convergence of a Symmetric Primal-dual Path Following Algorithm for Semidefinite Programming, manuscript, Department of Electrical and Computer Engineering, McMaster University, Ontario, Canada and Econometric Institute, Erasmus University, Rotterdam, The Netherlands, 1996.
17. N. MEGIDDO, Pathways to the optimal set in linear programming, in Progress in Mathematical Programming: Interior-Point Algorithms and Related Methods, N. Megiddo, ed., Springer-Verlag, Berlin, 1989, pp. 131-158.
18. S. MEHROTRA, Higher Order Methods and Their Performance, Technical Report 90-16R1, Dept. of IE and MS, Northwestern Univ., Evanson, IL, 1991.
19. R. D. C. MONTEIRO, Primal-dual path following algorithms for semidefinite programming, SIAM J. Optim., 7 (1997), pp. 663-678.
20. 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), pp. 191-214.
21. YU. E. NESTEROV AND A. S. NEMIROVSKII, Interior point Methods in Convex Programming: Theory and Application, SIAM, Philadelphia, PA, 1994.
22. YU. E. NESTEROV AND M. J. TODD, Self-scaled cones and interior-point methods in nonlinear programming, Math. Oper. Res., 22 (1997), pp. 1-42.
23. YU. E. NESTEROV AND M. J. TODD, Primal-dual interior point algorithms for self-scaled cones, SIAM J. Optim., 8 (1998), pp. 324-364.
24. G. PATAKI, On the Facial Structure of Cone-LP's and Semi-definite Programs, Research Report MSRR-595, Graduate School of Industrial Administration, Carnegie Mellon Univ., Pittsburgh, PA, 1994.
25. F. A. POTRA AND R. SHENG, Superlinear Convergence of Interior-point Algorithms for Semidefinite Programming, Research Report 86, Dept. of Mathematics, University of Iowa, IA, 1996.
26. M. RAMANA, L. TUNÇEL, AND H. WOLKOWICZ, Strong duality for semidefinite programming, SIAM J. Optim., 7 (1997), pp. 6 41-662.
27. K. SCHEINBERG, Issues in Interior Point Methods in Semidefinite and Linear Programming, Ph.D. thesis, Columbia University, New York, 1996.
28. M. SHIDA AND S. SHINDOH, Monotone Semidefinite Complementarity Problems, Working Paper B-312, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, Japan, 1996.
29. L. VANDERBERGHE AND S. BOYD, A primal-dual potential reduction method for problems involving matrix inequalities, Math. Programming, 69 (1995), pp. 205-236.
30. L. VANDERBERGHE AND S. BOYD, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95.
31. Y. YE, Convergence Behavior on Central Paths for Convex Homogeneous Self-dual Cones, note, Dept. of Managements, University of Iowa, IA, 1995.
32. Y. ZHANG, On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming, SIAM J. Optim., 8 (1998), pp 365-386.