Lagrangian dual interior-point methods for semidefinite programs

SIAM Journal on Optimization

Volumn 12, Issue 4, 2002, Pages 1007-1031

  Fukuda, Mituhiro ^a   Kojima, Masakazu ^a   Shida, Masayuki ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

BFGS quasi Newton method; Conjugate gradient method; Lagrangian dual; Predictor corrector method; Primal dual interior point method; Semidefinite program

Indexed keywords

EID: 0036435101     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623401387349     Document Type: Article

References (34)

1. 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.
2. S.J. Benson, Y. Ye, and X. Zhang, Solving large-scale sparse semidefinite programs for combinatorial optimization, SIAM J. Optim., 10 (2000), pp. 443-461.
3. B. Borchers, CSDP 2.3 user's guide, Optim. Methods Softw., 11-12 (1999), pp. 597-611; also available at http://www.nmt.edu/̃borchers/csdp.html.
4. S. Burer and R.D.C. Monteiro, A nonlinear programming algorithm for solving semidefinite program via low-rank factorization, Math. Program., to appear.
5. S. Burer, R.D.C. Monteiro, and Y. Zhang Interior-Point Algorithms for SemideFinite Programming Based on a Nonlinear Programming Formulation, TR99-27, Department of Computational and Applied Mathematics, Rice University, Houston, TX, 1999.
6. C. Choi and Y. Ye, Solving Sparse Semidefinite Programs Using the Dual Scaling Algorithm with an Iterative Solver, working paper, Department of Management Sciences, The University of Iowa, Iowa City, IA, 2000.
7. J.E. Dennis, Jr., and R.B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, NJ, 1983.
8. A.V. Fiacco and G.P. Mccormick, Nonlinear Programming: Sequential Unconstrained Minimization Technique, John Wiley, New York, 1968.
9. K. Fujisawa, K. Nakata, and M. Kojima, SDPA (SemiDefinite Programming Algorithm) User's Manual-Version 5.00, Research report B-308, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, 1995 (revised August 1996); also available at ftp://ftp.is.titech.ac.jp/pub/OpRes/software/SDPA.
10. M. Fukuda, M. Kojima, K. Murota, and K. Nakata, Exploiting sparsity in semidefinite programming via matrix completion I: General framework, SIAM J. Optim., 11 (2001), pp. 647-674.
11. A. George and J.W.H. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice Hall, Englewood Cliffs, NJ, 1981.
12. C. Helmberg and F. Rendl, Solving quadratic (0, 1)-problems by semidefinite programming and cutting planes, Math. Program., 82 (1998), pp. 291-315.
13. C. Helmberg and F. Rendl, A spectral bundle method for semidefinite programming, SIAM J. Optim., 10 (2000), pp. 673-696.
14. 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.
15. M. Kojima, N. Megiddo, S. Mizuno, and S. Shindoh, Horizontal and Vertical Decomposition in Interior-Point Methods for Linear Programs, working paper, Department of Information Sciences, Tokyo Institute of Technology, Tokyo, 1993.
16. M. Kojima, N. Megiddo, S. Mizuno, and S. Shindoh, Decomposition in Interior-Point Methods, Research report B-281, Department of Information Sciences, Tokyo Institute of Technology, Tokyo, 1994.
17. 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.
18. C.-J. Lin and R. Saigal, An incomplete Cholesky factorization for dense symmetric positive definite matrices, BIT, 40 (2000), pp. 536-558.
19. R.D.C. Monteiro, Primal-dual path-following algorithms for semidefinite programming, SIAM J. Optim., 7 (1997), pp. 663-678.
20. J.L. Morales and J. Nocedal, Algorithm 809: PREQN: Fortran 77 subroutines for preconditioning the conjugate gradient method, ACM Trans. Math. Software, 27 (2001), pp. 83-91.
21. K. Nakata, K. Fujisawa, M. Fukuda, M. Kojima, and K. Murota, Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results, Math. Program., to appear.
22. K. Nakata, K. Fujisawa, and M. Kojima, Using the conjugate gradient method in interior-point methods for semidefinite programs, Proc. Inst. of Statist. Math., 46 (1998), pp. 297-316 (in Japanese).
23. Yu. Nesterov and A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, PA, 1994.
24. M. Shida, An Interior-Point Smoothing Technique for Lagrange Relaxation in Convex Programming, working paper, Department of Mathematics, Kanagawa University, Yokohama, Japan, 1998.
25. J.F. Sturm, Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones, Optim. Methods Softw., 11-12 (1999), pp. 625-653; also available at http://fewcal.kub.nl/sturm/software/sedumi.html.
26. M.J. Todd, K.C. Toh, and R.H. Tütüncü, On the Nesterov-Todd direction in semidefinite programming, SIAM J. Optim., 8 (1998), pp. 769-796.
27. K.C. Toh and M. Kojima, Solving some large scale semidefinite programs via the conjugate residual method, SIAM J. Optim., 12 (2002), pp. 669-691.
28. K.C. Toh, M.J. Todd, and R.H. Tütüncü, SDPT3-a MATLAB software package for semidefinite programming, Version 1.3, Optim. Methods Softw., 11-12 (1999), pp. 545-581; also available at http://www.math.nus.edu.sg/̃mattohkc.
29. R.J. Vanderbei and H.Y. Benson, On Formulating Semidefinite Programming Problems as Smooth Convex Nonlinear Optimization Problems, ORFE 99-01, Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ, 1999 (revised 2000).
30. G.Y. Zhao, Interior-point methods with decomposition for solving large-scale linear programs, J. Optim. Theory Appl., 102 (1999), pp. 169-192.
31. G.Y. Zhao, A Log-barrier method with Benders decomposition for solving two-stage stochastic programs, Math. Program., 90 (2001), pp. 507-536.
32. G.Y. Zhao, A Lagrangian Dual Method with Self-Concordant Barrier for Multi-Stage Stochastic Convex Nonlinear Programming, working paper, Department of Mathematics, National University of Singapore, Singapore 1998 (revised 2000).
33. Q. Zhao, Semidefinite Programming for Assignment and Partitioning Problems, Ph.D. thesis, University of Waterloo, Waterloo, ON, Canada, 1996.
34. Q. Zhao, S.E. Karisch, F. Rendl, and H. Wolkowicz, Semidefinite programming relaxations for the quadratic assignment problem, J. Comb. Optim., 2 (1998), pp. 71-109.