{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T07:06:05Z","timestamp":1782889565394,"version":"3.54.5"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T00:00:00Z","timestamp":1281657600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1007\/s10107-010-0402-6","type":"journal-article","created":{"date-parts":[[2010,8,11]],"date-time":"2010-08-11T22:09:17Z","timestamp":1281564557000},"page":"33-68","source":"Crossref","is-referenced-by-count":79,"title":["Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion"],"prefix":"10.1007","volume":"129","author":[{"given":"Sunyoung","family":"Kim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Masakazu","family":"Kojima","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Mevissen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Makoto","family":"Yamashita","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,8,13]]},"reference":[{"key":"402_CR1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0024-3795(88)90240-6","volume":"107","author":"J. Agler","year":"1988","unstructured":"Agler J., Helton J.W., McCullough S., Rodman L.: Positive semidefinite matrices with a given sparsity pattern. Linear Algebra Appl. 107, 101\u2013149 (1988)","journal-title":"Linear Algebra Appl."},{"key":"402_CR2","volume-title":"The Reference Manual for SPOOLES, Release 2.3: An Object Oriented Software Library for Solving Linear Systems of Equations","author":"C. Ashcraft","year":"1999","unstructured":"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)"},{"key":"402_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4613-8369-7_1","volume-title":"Graph Theory and Sparse Matrix Computation","author":"J.R.S. Blair","year":"1993","unstructured":"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\u201329. Springer, New York (1993)"},{"key":"402_CR4","doi-asserted-by":"crossref","unstructured":"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\u201354. ACM press (2004)","DOI":"10.1145\/984622.984630"},{"key":"402_CR5","first-page":"689","volume":"11\u201312","author":"B. Borchers","year":"1999","unstructured":"Borchers B.: SDPLIB 1.2, A library of semidefinite programming test problems. Optim. Methods Softw. 11\u201312, 689 (1999)","journal-title":"Optim. Methods Softw."},{"key":"402_CR6","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/S1052623400366218","volume":"11","author":"M. Fukuda","year":"2000","unstructured":"Fukuda M., Kojima M., Murota K., Nakata K.: Exploiting sparsity in semidefinite programming via matrix completion I: General framework. SIAM J. Optim. 11, 647\u2013674 (2000)","journal-title":"SIAM J. Optim."},{"key":"402_CR7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0024-3795(84)90207-6","volume":"58","author":"R. Grone","year":"1984","unstructured":"Grone R., Johnson C.R., S\u00e1 E.M., Wolkowitz H.: Positive definite completions of a partial hermitian matrices. Linear Algebra Appl. 58, 109\u2013124 (1984)","journal-title":"Linear Algebra Appl."},{"key":"402_CR8","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/TAC.2005.863494","volume":"51","author":"D. Henrion","year":"2006","unstructured":"Henrion D., Lasserre J.B.: Convergent relaxations of polynomial matrix inequalities and static output feedback. IEEE Trans. Autom. Control 51, 192\u2013202 (2006)","journal-title":"IEEE Trans. Autom. Control"},{"key":"402_CR9","unstructured":"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)"},{"key":"402_CR10","unstructured":"Karypis, G., Kumar, V.: METIS\u2014A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Ordering of Sparse Matrices, version 4.0\u2013, Department of Computer Science\/Army HPC Research Center, University of Minnesota, Minneapolis, MN, September (1998)"},{"issue":"1","key":"402_CR11","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1137\/080713380","volume":"20","author":"S. Kim","year":"2009","unstructured":"Kim S., Kojima M., Waki H.: Exploiting sparsity in SDP relaxation for sensor network localization. SIAM J. Optim. 20(1), 192\u2013215 (2009)","journal-title":"SIAM J. Optim."},{"key":"402_CR12","unstructured":"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\u20138552 (2009)"},{"key":"402_CR13","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s00245-007-9030-9","volume":"58","author":"K. Kobayashi","year":"2008","unstructured":"Kobayashi K., Kim S., Kojima M.: Correlative sparsity in primal-dual interior-point methods for LP, SDP and SOCP. Appl. Math. Optim. 58, 69\u201388 (2008)","journal-title":"Appl. Math. Optim."},{"key":"402_CR14","unstructured":"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\u20138552, Japan, (November 2003)"},{"key":"402_CR15","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10107-006-0004-5","volume":"110","author":"M. Kojima","year":"2007","unstructured":"Kojima M., Muramatsu M.: An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones. Math. Program. 110, 315\u2013336 (2007)","journal-title":"Math. Program."},{"key":"402_CR16","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10589-007-9112-2","volume":"42","author":"M. Kojima","year":"2009","unstructured":"Kojima M., Muramatsu M.: A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones. Comput. Optim. Appl. 42, 31\u201341 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"402_CR17","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J.B. Lasserre","year":"2001","unstructured":"Lasserre J.B.: Global optimization with polynomials and the problems of moments. SIAM J. Optim. 11, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"402_CR18","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1137\/05064504X","volume":"17","author":"J.B. Lasserre","year":"2006","unstructured":"Lasserre J.B.: Convergent SDP-relaxations in polynomial optimization with sparsity. SIAM J. Optim. 17(3), 822\u2013843 (2006)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"402_CR19","first-page":"213","volume":"4","author":"M. Mevissen","year":"2008","unstructured":"Mevissen M., Kojima M., Nie J., Takayama N.: Solving partial differential equations via sparse SDP relaxations. Paci. J. Optim. 4(2), 213\u2013241 (2008)","journal-title":"Paci. J. Optim."},{"key":"402_CR20","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10107-002-0351-9","volume":"95","author":"K. Nakata","year":"2003","unstructured":"Nakata K., Fujisawa K., Fukuda M., Kojima M., Murota K.: Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results. Math. Program. 95, 303\u2013327 (2003)","journal-title":"Math. Program."},{"key":"402_CR21","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior Point Polynomial Methods in Convex Programming: Theory and Applications","author":"E. Nesterov Ju","year":"1994","unstructured":"Nesterov Ju E., Nemirovski A.S.: Interior Point Polynomial Methods in Convex Programming: Theory and Applications. SIAM, Philadelphia, PA (1994)"},{"key":"402_CR22","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11 & 12","author":"J.F. Strum","year":"1999","unstructured":"Strum J.F.: SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11 & 12, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"402_CR23","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/050623802","volume":"17","author":"H. Waki","year":"2006","unstructured":"Waki H., Kim S., Kojima M., Muramatsu M.: Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity. SIAM J. Optim. 17, 218\u2013242 (2006)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"402_CR24","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/1377612.1377619","volume":"35","author":"H. Waki","year":"2008","unstructured":"Waki H., Kim S., Kojima M., Muramatsu M., Sugimoto H.: SparsePOP : A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems. ACM Trans. Math. Software 35(2), 15 (2008)","journal-title":"ACM Trans. Math. Software"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0402-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0402-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0402-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:59:34Z","timestamp":1559397574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0402-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,13]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["402"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0402-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,13]]}}}