Exploiting sparsity in semidefinite programming via matrix completion I: General framework

SIAM Journal on Optimization

Volumn 11, Issue 3, 2000, Pages 647-674

  Fukuda, Mituhiro ^a   Kojima, Masakazu ^a   Murota, Kazuo ^b   Nakata, Kazuhide ^c  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b KYOTO UNIVERSITY   (Japan)

^c UNIVERSITY OF TOKYO   (Japan)

Author keywords

Chordal graph; Matrix completion problem; Primal dual interior point method; Semidefinite programming

Indexed keywords

EID: 0035238840     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623400366218     Document Type: Article

References (28)

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. J. R. S. BLAIR AND B. PEYTON, An introduction to chordal graphs and clique, trees, in Graph Theory and Sparse Matrix Computation, A. George, J. R. Gilbert, and J. W. H. Liu, eds., Springer-Verlag, New York, 1993, pp. 1-29.
4. B. BORCHERS, CSDP 2.3 user's guide, Optim. Methods Softw., 11-12 (1999), pp. 597-611. Available at http://www.nmt.edu/~borchers/csdp.html.
5. K. FUJISAWA, M. FUKUDA, M. KOJIMA, AND K. NAKATA, Numerical evaluation of SDPA (semidefinite programming algorithm), in High Performance Optimization, H. Frenk, K. Roos, T. Terlaky, and S. Zhang, eds., Kluwer Academic Publishers, Dordrecht, 1999, pp. 267-301.
6. K. FUJISAWA, M. KOJIMA, AND K. NAKATA, SDPA (Semidefinite Programming Algorithm) User's Manual, Technical Report B-308, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Japan, December 1995 (revised August 1996). Available at ftp://ftp.is.titech.ac.jp/pub/OpRes/software/SDPA.
7. K. FUJISAWA, M. KOJIMA, AND K. NAKATA, Exploiting sparsity in primal-dual interior-point methods for semidefinite programming, Math. Program., 79 (1997), pp. 235-253.
8. D. R. FULKERSON AND O. A. GROSS, Incidence matrices and interval graphs, Pacific J. Math., 15 (1965), pp. 835-855.
9. A. GEORGE AND J. W. H. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
10. M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
11. R. GRONE, C. R. JOHNSON, E. M. SÁ, AND H. WOLKOWICZ, Positive definite completions of partial hermitian matrices, Linear Algebra Appl., 58 (1984), pp. 109-124.
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, F. RENDL, R. J. VANDERBEI, AND H. WOLKOWICZ, An interior-point method for semidefinite programming, SIAM J. Optim., 6 (1996), pp. 342-361.
14. C. R. JOHNSON, Matrix completion problems: A survey, Proc. Sympos. Appl. Math., 40 (1990), pp. 171-198.
15. 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.
16. 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.
17. M. LAURENT, Cuts, matrix completions and graph rigidity, Math. Program., 79 (1997), pp. 255-283.
18. J. G. LEWIS, B. W. PEYTON, AND A. POTHEN, A fast algorithm for reordering sparse matrices for parallel factorization, SIAM J. Sci. Stat. Comput., 10 (1989), pp. 1146-1173.
19. C.-J. LIN AND R. SAIGAL, An incomplete Cholesky factorization for dense symmetric positive definite matrices, BIT, 40 (2000), pp. 536-558.
20. R. D. C. MONTEIRO, Primal-dual path-following algorithms for semidefinite programming, SIAM J. Optim., 7 (1997), pp. 663-678.
21. R. D. C. MONTEIRO AND Y. ZHANG, A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming, Math. Program., 81 (1998), pp. 281-299.
22. K. NAKATA, K. FUJISAWA, M. FUKUDA, M. KOJIMA, AND K. MUROTA, Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results, in preparation.
23. K. NAKATA, K. FUJISAWA, AND M. KOJIMA, Using the conjugate gradient method in interior-point methods for semidefinite programs, in Proc. Inst. Statist. Math., 46 (1998), pp. 297-316 (in Japanese).
24. Yu. E. NESTEROV AND M. J. TODD, Primal-dual interior-point methods for self-scaled cones, SIAM J. Optim., 8 (1998), pp. 324-364.
25. M. OHSAKI, K. FUJISAWA, N. KATOH, AND Y. KANNO, Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints, Comput. Methods Appl. Mech. Engrg., 180 (1999), pp. 203-217.
26. D. J. ROSE, R. E. TARJAN, AND G. S. LUEKER, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., 5 (1976), pp. 266-283.
27. 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.
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. Available at http://www.math.nus.edu.sg/~mattohkc.