Solving large scale semidefinite programs via an iterative solver on the augmented systems

SIAM Journal on Optimization

Volumn 14, Issue 3, 2004, Pages 670-698

  Toh, Kim Chuan ^a,b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b SINGAPORE MIT ALLIANCE   (Singapore)

Author keywords

Augmented systems; Conjugate residual method; Interior point methods; Large scale semidefinite programming; Maximum clique problem; Preconditioners; Symmetric quasi minimal residual method

Indexed keywords

EID: 4043058006     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623402419819     Document Type: Article

References (35)

1. F. ALIZADEH, J.-P. A. HAEBERLY, AND M. L. OVERTON, Primal-dual interior-point methods for semidefinite programming: Convergence results, stability and numerical results, SIAM J. Optim., 8 (1998), pp. 746-768.
2. F. ALIZADEH, J. A. HAEBERLY, AND M. OVERTON, Complementarity and nondegeneracy in semidefinite programming, Math. Programming, 77 (1997), pp. 111-128.
3. S. BURER AND R. MONTERIO, A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization, Math. Program., 95 (2003), pp. 329-357.
4. S. BURER, R. MONTERIO, AND Y. ZHANG, Solving a class of semidefinite programs via nonlinear programming, Math. Program., 93 (2002), pp. 97-122.
5. S. BURER, R. MONTERIO, AND Y. ZHANG, A computational study of a gradient-based log-barrier algorithm for a class of large scale SDPs, Math. Program., 95 (2003), pp. 359-379.
6. B. BORCHERS, SDPLIB 1.2, a library of semidefinite programming test problems, Optim. Methods Softw., 11/12 (1999), pp. 683-690.
7. 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.
8. C. CHOI AND Y. YE, Solving Sparse Semidefinite Programs Using the Dual Scaling Algorithm with an Iterative Solver, working paper, Computational Optimization Laboratory, University of Iowa, Iowa City, IA, 2000.
9. M. TRICK, V. CHVATAL, W. COOK, D. JOHNSON, C. MCGEOCH, AND R. TARJAN, The Second DIMACS Implementation Challenge: NP Hard Problems: Maximum Clique, Graph Coloring, and Satisfiability, Rutgers University, http://dimacs.rutgers.edu/ Challenges/ (1992).
10. T. A. DRISCOLL, K.-C. TOH, AND L. N. TREFETHEN, From potential theory to matrix iterations in six steps, SIAM Rev., 40 (1998), pp. 547-578.
11. A. EISENBLÄTTER, M. GRÖTSCHEL, AND A. M. C. A. KOSTER, Frequency planning and ramification of coloring, Discuss. Math. Graph Theory, 22 (2002), pp. 51-88.
12. R. W. FREUND AND N. M. NACHTIGAL, A new Krylov-subspace method for symmetric indefinite linear systems, in Proceedings of the 14th IMACS World Congress on Computational and Applied Mathematics, W. F. Ames, ed., Atlanta, GA, 1994, pp. 1253-1256.
13. K. FUJISAWA, M. KOJIMA, AND K. NAKATA, Exploiting sparsity in primal-dual interior-point methods for semidefinite programming, Math. Programming, 79 (1997), pp. 235-253.
14. M. FUKUDA, M. KOJIMA, AND M. SHIDA, Lagrangian dual interior-point methods for semidefinite programs, SIAM J. Optim., 12 (2002), pp. 1007-1031.
15. M. FUKUDA, M. KOJIMA, K. MUROTA, AND K. NAKATA, Exploiting sparsity in semidefinite programming via matrix completion I: General framework, SIAM J. Optim., 11 (2000), pp. 647-674.
16. C. HELMBERG AND K. C. KIWIEL, A spectral bundle method with bounds, Math. Program., 93 (2002), pp. 173-194.
17. 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.
18. M. KOJIMA, S. SHINDOH, AND S. KARA, Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices, SIAM J. Optim., 7 (1997), pp. 86-125.
19. M. KOJIMA, M. SHIDA, AND S. SHINDOH, Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation, Math. Program., 85 (1999), pp. 51-80.
20. C.-J. LIN AND R. SAIGAL, An incomplete Cholesky factorization for dense symmetric positive definite matrices, BIT, 40 (2000), pp. 536-558.
21. R. D. C. MONTEIRO, Primal-dual path-following algorithms for semidefinite programming, SIAM J. Optim., 7 (1997), pp. 663-678.
22. K. NAKATA, K. FUJISAWA, AND M. KOJIMA, Using the conjugate gradient method in interior-points methods for semidefinite programs (in Japanese), Proc. Inst. Statist. Math., 46 (1998), pp. 297-316 (in Japanese).
23. K. NAKATA, S.-L, ZHANG, AND M. KOJIMA, Preconditioned Conjugate Gradient Methods for Large Scale and Dense Linear Systems in Semidefinite Programming, abstract based on talks delivered at INFORMS Meeting, Philadelphia, 1999.
24. C. C. PAIGE AND M. A. SAUNDERS, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal, 12 (1975), pp. 617-629.
25. G. PATAKI, On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues, Math. Oper. Res., 23 (1998), pp. 339-358.
26. K. K. PHOON, K. C. TOH, S. H. CHAN, AND F. H. LEE, An efficient diagonal preconditioner for finite element solution of Biot's consolidation equations, Internat. J. Numer. Methods Engrg., 55 (2002), pp. 377-400.
27. G. GRUBER AND F. RENDL, Computational experience with stable set relaxations, SIAM J. Optim., 13 (2003), pp. 1014-1028.
28. Y. SAAD, Iterative Methods for Sparse Linear Systems, PWS, Boston, 1996.
29. K. C. TOH, An Analysis of Ill-Conditioned Equilibrium Systems, Technical report, Department of Mathematics, National University of Singapore, Singapore, 2002.
30. 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.
31. 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.
32. 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 (1999), pp. 545-581.
33. V. V. KOVACEVIC-VUJCIC AND M. D. ASIC, Stabilization of interior-point methods for linear programming, Comput. Optim. Appl., 14 (1999), pp. 331-346.
34. Y. ZHANG, On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming, SIAM J. Optim., 8 (1998), pp. 365-386.
35. 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.