Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results

Mathematical Programming, Series B

Volumn 95, Issue 2, 2003, Pages 303-327

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

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b KYOTO UNIVERSITY   (Japan)

^c UNIVERSITY OF TOKYO   (Japan)

Author keywords

Clique tree; Matrix completion problem; Numerical results; Primal dual interior point method; Semidefinite programming

Indexed keywords

DATA REDUCTION; MATRIX ALGEBRA; NUMERICAL METHODS; PROBLEM SOLVING; TREES (MATHEMATICS);

CLIQUE TREE; MATRIX COMPLETION PROBLEM; PRIMAL-DUAL INTERIOR-POINT METHOD; SEMIDEFINITE PROGRAMMING;

NONLINEAR PROGRAMMING;

EID: 1542337154     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-002-0351-9     Document Type: Article

References (24)

1. Ashcraft, C., Pierce, D., Wah, D.K., Wu, J. (1999): The reference manual for SPOOLES, release 2.2: An object oriented software library for solving sparse linear systems of equations. Boeing Shared Services Group, Seattle, WA, January 1999; available at http://cm.bell-labs.com/netlib/linalg/spooles
2. Blair, J.R.S., Peyton, B. (1993): An introduction to chordal graphs and clique trees. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.), Graph Theory and Sparse Matrix Computation. Springer-Verlag, pp 1-29
3. Borchers, B. (1999): CSDP 2.3 user's guide. Optim. Methods Softw. 11-12(1-4), 597-611 ; available at http://www.nmt.edu/~borchers/csdp.html
4. Choi, C., Ye, Y. (2000): Solving sparse semidefinite programs using the dual scaling algorithm with an iterative solver. Department of Management Sciences, The University of Iowa, Iowa City, IA, March 2000
5. Fujisawa, K., Fukuda, M., Kojima, M., Nakata, K. (2000): Numerical evaluation of SDPA (SemiDefinite Programming Algorithm). In: Frenk, H., Roos, K., Terlaky, T., Zhang, S. (eds.), High Performance Optimization. Kluwer Academic Publishers, pp 267-301
6. Fujisawa, K., Kojima, M., Nakata, K. (2000): SDPA (Semidefinite Programming Algorithm) - User's Manual -. Technical Report B-308, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro, Tokyo, December 1995 (revised August 2000); available at http://www.is.titech.ac.jp/~kojima/sdpa
7. Fujisawa, K., Kojima, M., Nakata, K. (1997): Exploiting sparsity in primal-dual interior-point methods for semidefinite programming. Math. Program. 79(1-3), 235-253
8. Fukuda, M., Kojima, M., Murota, K., Nakata, K. (2000): Exploiting sparsity in semidefinite programming via matrix completion I: General framework. SIAM J. Optim. 11(3), 647-674
9. Grone, R., Johnson, C.R., Sá, E.M., Wolkowicz, H. (1984): Positive definite completions of partial hermitian matrices. Linear Algebra Appl. 58, 109-124
10. Helmberg, C., Rendl, F., Vanderbei, R.J., Wolkowicz, H. (1996): An interior-point method for semidefinite programming. SIAM J. Optim. 6(2), 342-361
11. Johnson, C.R. (1990): Matrix completion problems: A survey. Proc. Sympos. Appl. Math. 40, 171-198
12. Karypis, G., Kumar, V. (1998): METIS - A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices, version 4.0 -. Department of Computer Science/Army HPC Research Center, University of Minnesota, Minneapolis, MN, September 1998; available at http://www-users.cs.umn.edu/~karypis/metis/ metis
13. Kojima, M., Shindoh, S., Hara, S. (1997): Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM J. Optim. 7(1), 86-125
14. Lewis, J.G., Peyton, B.W., Pothen, A. (1989): A fast algorithm for reordering sparse matrices for parallel factorization. SIAM J. Sci. Statist. Comput. 10(6), 1146-1173
15. Lin, C.-J., Saigal, R. (2000): An incomplete Cholesky factorization for dense symmetric positive definite matrices. BIT 40(3), 536-558
16. Monteiro, R.D.C. (1997): Primal-dual path-following algorithms for semidefinite programming. SIAM J. Optim. 7(3), 663-678
17. Nakata, K., Fujisawa, K., Kojima, M. (1998): Using the conjugate gradient method in interior-point methods for semidefinite programs. Proc. Inst. Statist. Math. 46(2), 297-316 (in Japanese)
18. Nesterov, Yu., Todd, M.J. (1998): Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8(2), 324-364
19. Sturm, J.F. (1999): Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11-12(1-4), 625-653; available at http://fewcal.kub.nl/sturm/software/sedumi.html
20. Tarjan, R.E., Yannakakis, M. (1984): Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13(3), 566-579
21. Todd, M.J. (1999): A study of search directions in primal-dual interior-point methods for semidefinite programming. Optim. Methods Softw. 11-12(1-4), 1-46
22. Toll, K.C., Kojima, M. (2002): Solving some large scale semidefinite programs via the conjugate residual method. SIAM J. Optim. 12(3), 669-691
23. Ton, K.C., Todd, M.J., Tütüncü, R.H. (1999): SDPT3 - a MATLAB software package for semidefinite programming, version 1.3. Optim. Methods Sofuv. 11-12(1-4), 545-581; available at http://www.math.nus.edu.sg/ ~mattohkc
24. Vandenberghe, L., Boyd, S. (1996): Semidefinite Programming. SIAM Rev. 38(1), 49-95