A Predictor-Corrector Algorithm for QSDP Combining Dikin-Type and Newton Centering Steps

Annals of Operations Research

Volumn 103, Issue 1-4, 2001, Pages 115-133

  Nie, Jia Wang ^a   Yuan, Ya Xiang ^a  

^a INSTITUTE OF COMPUTATIONAL MATHEMATICS AND SCIENTIFIC ENGINEERING COMPUTING   (China)

Author keywords

Central path; Corrector step; Dikin type step; Newton centering step; Potential function; Predictor step; Quadratic term; Semi definite programming

Indexed keywords

EID: 0035729262     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/A:1012994820412     Document Type: Article

References (20)

1. F. Alizadeh, Interior point methods in semidefinite programming with application to combinatorial optimization, SIAM J. Opt. 5 (1995) 13-51.
2. F. Alizadeh, J.-P.A. Haeberly, M.L. Overton, Primal-dual interior point methods for semidefinite programming: Convergence rates, stability and numerical results, SIAM J. Opt. 8 (1998) 746-768.
3. K. Fujisawa, M. Kojima and K. Nakata, Exploiting sparsity in primal-dual interior-point methods for semidefinite programming, Math. Programming 79 (1997) 235-253.
4. G.H. Golub and C.F. Van Loan, Matrix Computations, 3rd ed. (Johns Hopkins University Press, Baltimore, 1996).
5. B. Jansen, C. Roos, T. Terlaky and J.P. Vial, Primal-dual algorithms for linear programming based on the logarithmic barrier method, J. Optim. Theory Appl. 83 (1994) 1-26.
6. J. Jiang, A long step primal-dual path following method for semidefinite programming, Operations Research Letters 21 (1998) 53-61.
7. E. De Klerk, Interior point methods for SDP, Ph.D. thesis, Delft University of Technology, Delft, The Netherlands (1997).
8. M. Kojima, S. Shindoh and S. Hara, Interior-point methods for the monotone semidefinite linear complementarity problems, SIAM J. Opt. 7 (1997) 86-125.
9. A. Nemirovskii and P. Gahinet, The projective method for solving linear matrix inequalities, Math. Programming, Series B 77 (1997) 163-190.
10. Y. Nesterov and M.J. Todd, Self-scaled barriers and interior-point methods for convex programming, Mathematics of Operations Research 22 (1997) 1-42.
11. Y. Nesterov and M.J. Todd, Primal-dual interior-point methods for self-scaled cones, SIAM J. Opt. 8 (1998) 32-364.
12. J.W. Nie and Y. Yuan, A potential reduction algorithm for an extended SDP problem, Science in China 43 (2000) 35-46.
13. H.D. Qi and X. Chen, On stationary points of merit functions for semi-definite complementarity problems, Report, ICMSEC, Chinese Academy of Sciences (1997).
14. J.F. Sturm and S. Zhang, Symmetric primal-dual path following algorithms for semidefinite programming. Applied Numerical Mathematics 29 (1999) 301-315.
15. M.J. Todd, K.C. Toh and R.H. Tütüncü, On the Nesterov-Todd direction in semidefinite programming, SIAM J. Opt. 8 (1998) 769-796.
16. P. Tseng, Search directions and convergence analysis of some infeasible path-following methods for the monotone semi-definite LCP, Optimization Methods and Software 9 (1998) 245-268.
17. Y. Ye, Interior Point Algorithm Theory and Analysis (Wiley, New York, 1998).
18. Y. Yuan, Numerical Methods for Nonlinear Programming (Shanghai Sci. Tech. Publishers, Shanghai, 1993) (in Chinese).
19. Y. Zhang, On extending primal-dual interior-point algorithms from linear programming to semidefinite programming, SIAM J. Opt. 8 (1998) 365-386.
20. Q. Zhao, S.E. Karische, F. Rendl and H. Wolkowicz, Semidefinite programming relaxations for the quadratic assignment problem, CORR Report 95-27, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada (1996).