{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T05:28:23Z","timestamp":1770355703951,"version":"3.49.0"},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2008,7,1]],"date-time":"2008-07-01T00:00:00Z","timestamp":1214870400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004084","name":"Korea Science and Engineering Foundation","doi-asserted-by":"publisher","award":["R01-2005-000-10271-0"],"award-info":[{"award-number":["R01-2005-000-10271-0"]}],"id":[{"id":"10.13039\/501100004084","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["16016234"],"award-info":[{"award-number":["16016234"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["19310096"],"award-info":[{"award-number":["19310096"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["15740054"],"award-info":[{"award-number":["15740054"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2008,7,25]]},"abstract":"<jats:p>SparsePOP is a Matlab implementation of the sparse semidefinite programming (SDP) relaxation method for approximating a global optimal solution of a polynomial optimization problem (POP) proposed by Waki et al. [2006]. The sparse SDP relaxation exploits a sparse structure of polynomials in POPs when applying \u201ca hierarchy of LMI relaxations of increasing dimensions\u201d Lasserre [2006]. The efficiency of SparsePOP to approximate optimal solutions of POPs is thus increased, and larger-scale POPs can be handled.<\/jats:p>","DOI":"10.1145\/1377612.1377619","type":"journal-article","created":{"date-parts":[[2008,7,29]],"date-time":"2008-07-29T13:22:19Z","timestamp":1217337739000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":102,"title":["Algorithm 883"],"prefix":"10.1145","volume":"35","author":[{"given":"Hayato","family":"Waki","sequence":"first","affiliation":[{"name":"Tokyo Institute of Technology"}]},{"given":"Sunyoung","family":"Kim","sequence":"additional","affiliation":[{"name":"Ewha W. University"}]},{"given":"Masakazu","family":"Kojima","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology"}]},{"given":"Masakazu","family":"Muramatsu","sequence":"additional","affiliation":[{"name":"The University of Electro-Communications"}]},{"given":"Hiroshi","family":"Sugimoto","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology"}]}],"member":"320","published-online":{"date-parts":[[2008,7]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Blair J. R. S. and Peyton B. 1994. An introduction to chordal graphs and clique trees. In Graph Theory and Sparse Matrix Computation. Springer New York 1--29. Blair J. R. S. and Peyton B. 1994. An introduction to chordal graphs and clique trees. In Graph Theory and Sparse Matrix Computation . Springer New York 1--29.","DOI":"10.1007\/978-1-4613-8369-7_1"},{"key":"e_1_2_2_2_1","unstructured":"Fujisawa K. Kojima M. and Nakata K. 1995. SDPA (SemiDefinite Programming Algorithm) User's Manual Version 5.0. Res. Rep. B-308 Department of Mathematical and Computing Sciences Tokyo Institute of Technology Oh-Okayama Meguro Tokyo 152-8552 Japan. Fujisawa K. Kojima M. and Nakata K. 1995. SDPA (SemiDefinite Programming Algorithm) User's Manual Version 5.0 . Res. Rep. B-308 Department of Mathematical and Computing Sciences Tokyo Institute of Technology Oh-Okayama Meguro Tokyo 152-8552 Japan."},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400366218"},{"key":"e_1_2_2_4_1","unstructured":"Global Library. 2008. Global library. http:\/\/www.gamsworld.org\/global\/globallib.htm+. Global Library. 2008. Global library. http:\/\/www.gamsworld.org\/global\/globallib.htm+."},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/779359.779363"},{"key":"e_1_2_2_6_1","unstructured":"Henrion D. Lasserre J. B. and Loefberg J. 2008. Gloptipoly 3. http:\/\/www.laas.fr\/~henrion\/software\/gloptipoly3\/+. Henrion D. Lasserre J. B. and Loefberg J. 2008. Gloptipoly 3. http:\/\/www.laas.fr\/~henrion\/software\/gloptipoly3\/+."},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/030601260"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0554-3"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400366802"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/05064504X"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2005.07.002"},{"key":"e_1_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Strum J. F. 1999. SeDuMi 1.02 a Matlab toolbox for optimization over symmetric cones. Optim. Methods Softw. 11--12 625--653. Strum J. F. 1999. SeDuMi 1.02 a Matlab toolbox for optimization over symmetric cones. Optim. Methods Softw. 11--12 625--653.","DOI":"10.1080\/10556789908805766"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0347-5"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623402419819"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400376378"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/050623802"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1080\/1055678031000118482"}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1377612.1377619","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1377612.1377619","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:56Z","timestamp":1750255076000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1377612.1377619"}},"subtitle":["SparsePOP---A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems"],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,7,25]]}},"alternative-id":["10.1145\/1377612.1377619"],"URL":"https:\/\/doi.org\/10.1145\/1377612.1377619","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"value":"0098-3500","type":"print"},{"value":"1557-7295","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7]]},"assertion":[{"value":"2007-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}