Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion

Mathematical Programming

Volumn 129, Issue 1, 2011, Pages 33-68

  Kim, Sunyoung ^a   Kojima, Masakazu ^b   Mevissen, Martin ^b   Yamashita, Makoto ^b  

^a Ewha Womans University   (South Korea)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Chordal Graph; Matrix Inequalities; Polynomial Optimization; Positive Semidefinite Matrix Completion; Semidefinite Program; Sparsity

Indexed keywords

CHORDAL GRAPHS; MATRIX INEQUALITY; POLYNOMIAL OPTIMIZATION; POSITIVE SEMIDEFINITE MATRICES; SEMIDEFINITE PROGRAMS; SPARSITY;

CONSTRAINT THEORY; NUMERICAL METHODS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

LINEAR MATRIX INEQUALITIES;

EID: 80052599881     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-010-0402-6     Document Type: Article

References (24)

1. J. Agler J.W. Helton S. McCullough L. Rodman 1988 Positive semidefinite matrices with a given sparsity pattern Linear Algebra Appl. 107 101 149 960140 0655.15016 10.1016/0024-3795(88)90240-6
2. Ashcraft C., Pierce D., Wah D.K., Wu J.: The Reference Manual for SPOOLES, Release 2.3: An Object Oriented Software Library for Solving Linear Systems of Equations. Boeing Shared Services Group, Seattle, WA (1999)
3. Blair J.R.S., Peyton B.: 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, pp. 1-29. Springer, New York (1993)
4. Biswas, P., Ye, Y.: Semidefinite programming for ad hoc wireless sensor network localization. In: Proceedings of the Third International Symposium on Information Processing in Sensor Networks, pp. 46-54. ACM press (2004)
5. B. Borchers 1999 SDPLIB 1.2, A library of semidefinite programming test problems Optim. Methods Softw. 11-12 689
6. M. Fukuda M. Kojima K. Murota K. Nakata 2000 Exploiting sparsity in semidefinite programming via matrix completion I: General framework SIAM J. Optim. 11 647 674 1814036 1010.90053 10.1137/S1052623400366218
7. R. Grone C.R. Johnson E.M. Sá H. Wolkowitz 1984 Positive definite completions of a partial hermitian matrices Linear Algebra Appl. 58 109 124 739282 0547.15011 10.1016/0024-3795(84)90207-6
8. D. Henrion J.B. Lasserre 2006 Convergent relaxations of polynomial matrix inequalities and static output feedback IEEE Trans. Autom. Control 51 192 202 2201707 10.1109/TAC.2005.863494 (Pubitemid 43279982)
9. Hol, C.W.J., Scherer, C.W.: Sum of squares relaxations for polynomial semidefinite programming. In: Proc. Symp. on Mathematical Theory of Networks and Systems (MTNS). Leuven, Belgium (2004)
10. Karypis, G., Kumar, V.: METIS-A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Ordering of Sparse Matrices, version 4.0-, Department of Computer Science/Army HPC Research Center, University of Minnesota, Minneapolis, MN, September (1998)
11. S. Kim M. Kojima H. Waki 2009 Exploiting sparsity in SDP relaxation for sensor network localization SIAM J. Optim. 20 1 192 215 2496899 1190.65096 10.1137/080713380
12. Kim, S., Kojima, M., Waki, H., Yamashita, M.: SFSDP: a Sparse Version of Full Semidefinite Programming Relaxation for Sensor Network Localization Problems. Research Report B-457, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, Meguro, Tokyo, pp. 152-8552 (2009)
13. K. Kobayashi S. Kim M. Kojima 2008 Correlative sparsity in primal-dual interior-point methods for LP, SDP and SOCP Appl. Math. Optim. 58 69 88 2426124 1191.90032 10.1007/s00245-007-9030-9
14. Kojima, M.: Sums of Squares Relaxations of Polynomial Semidefinite Programs, Research Report B-397, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro, Tokyo, pp. 152-8552, Japan, (November 2003)
15. M. Kojima M. Muramatsu 2007 An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones Math. Program. 110 315 336 2313782 1210.90159 10.1007/s10107-006-0004-5 (Pubitemid 46496751)
16. M. Kojima M. Muramatsu 2009 A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones Comput. Optim. Appl. 42 31 41 2471185 1153.90545 10.1007/s10589-007-9112-2
17. J.B. Lasserre 2001 Global optimization with polynomials and the problems of moments SIAM J. Optim. 11 796 817 1814045 1010.90061 10.1137/ S1052623400366802
18. J.B. Lasserre 2006 Convergent SDP-relaxations in polynomial optimization with sparsity SIAM J. Optim. 17 3 822 843 2257211 1119.90036 10.1137/05064504X (Pubitemid 47265174)
19. M. Mevissen M. Kojima J. Nie N. Takayama 2008 Solving partial differential equations via sparse SDP relaxations Paci. J. Optim. 4 2 213 241 2426626 1161.90458
20. K. Nakata K. Fujisawa M. Fukuda M. Kojima K. Murota 2003 Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results Math. Program. 95 303 327 1976483 1030.90081 10.1007/s10107-002-0351-9 (Pubitemid 44757857)
21. Nesterov Ju E., Nemirovski A.S.: Interior Point Polynomial Methods in Convex Programming: Theory and Applications. SIAM, Philadelphia, PA (1994)
22. J.F. Strum 1999 SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones Optim. Methods Softw. 11 & 12 625 653 10.1080/ 10556789908805766
23. H. Waki S. Kim M. Kojima M. Muramatsu 2006 Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity SIAM J. Optim. 17 218 242 2219151 1109.65058 10.1137/050623802 (Pubitemid 46279501)
24. H. Waki S. Kim M. Kojima M. Muramatsu H. Sugimoto 2008 SparsePOP : A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems ACM Trans. Math. Software 35 2 15 2528519 10.1145/1377612.1377619