{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T02:43:50Z","timestamp":1782441830324,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T00:00:00Z","timestamp":1562544000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Nature Science Foundation of China","award":["61732001"],"award-info":[{"award-number":["61732001"]}]},{"name":"National Nature Science Foundation of China","award":["61532019"],"award-info":[{"award-number":["61532019"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,8]]},"DOI":"10.1145\/3326229.3326254","type":"proceedings-article","created":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T12:53:20Z","timestamp":1562676800000},"page":"347-354","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["A New Sparse SOS Decomposition Algorithm Based on Term Sparsity"],"prefix":"10.1145","author":[{"given":"Jie","family":"Wang","sequence":"first","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haokun","family":"Li","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bican","family":"Xia","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(88)90240-6"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1024074.1024081"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1084-3"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2012.656114"},{"key":"e_1_3_2_1_5_1","volume-title":"Blair and Barry Peyton","author":"Jean R.","year":"1993","unstructured":"Jean R. S. Blair and Barry Peyton. 1993. An Introduction to Chordal Graphs and Clique Trees. In Graph Theory and Sparse Matrix Computation, Alan George, John R. Gilbert, and Joseph W. H. Liu (Eds.). Springer New York, New York, NY, 1--29."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1109060"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of Symposia in Pure mathematics","volume":"58","author":"Choi Man-Duen","year":"1995","unstructured":"Man-Duen Choi, Tsit Yuen Lam, and Bruce Reznick. 1995. Sums of squares of real polynomials. In Proceedings of Symposia in Pure mathematics, Vol. 58. American Mathematical Society, 103-- 126."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/646589.697342"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-015-0300-9"},{"key":"e_1_3_2_1_10_1","volume-title":"Incidence matrices and interval graphs. Pacific journal of mathematics 15, 3","author":"Fulkerson Delbert","year":"1965","unstructured":"Delbert Fulkerson and Oliver Gross. 1965. Incidence matrices and interval graphs. Pacific journal of mathematics 15, 3 (1965), 835--855."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2003.12.011"},{"key":"e_1_3_2_1_12_1","volume-title":"Algorithmic graph theory and perfect graphs","author":"Golumbic Martin Charles","unstructured":"Martin Charles Golumbic. 2004. Algorithmic graph theory and perfect graphs. Vol. 57. Elsevier."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837934.1837960"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of Topics in Number Theory and Combinatorics","author":"Haglund James","year":"1997","unstructured":"James Haglund, Ken Ono, and David G Wagner. 1997. Theorems and conjectures involving rook polynomials with real roots. Proceedings of Topics in Number Theory and Combinatorics, State (1997), 207--221."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.12.003"},{"key":"e_1_3_2_1_16_1","volume-title":"Handbook on Semidefinite, Conic and Polynomial Optimization","author":"Henrion Didier","unstructured":"Didier Henrion and J\u00b4er^ome Malick. 2012. Projection methods in conic optimization. In Handbook on Semidefinite, Conic and Polynomial Optimization. Springer, 565--600."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1577190.1577204"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0554-3"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400366802"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/CACSD.2004.1393890"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2017144"},{"key":"e_1_3_2_1_22_1","volume-title":"On Exact Polya and Putinar's Representations. arXiv preprint arXiv:1802.10339","author":"Magron Victor","year":"2018","unstructured":"Victor Magron and Mohab Safey El Din. 2018. On Exact Polya and Putinar's Representations. arXiv preprint arXiv:1802.10339 (2018)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3208976.3208986"},{"key":"e_1_3_2_1_24_1","volume-title":"Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy. Discrete Applied Mathematics","author":"Marandi Ahmadreza","year":"2018","unstructured":"Ahmadreza Marandi, Etienne de Klerk, and Joachim Dahl. 2018. Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy. Discrete Applied Mathematics (2018)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/060668791"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/060\/08"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2014.7040427"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2015.7403367"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.09.025"},{"key":"e_1_3_2_1_31_1","volume-title":"SOSTOOLS: sum of squares optimization toolbox for MATLAB--users guide. Control and Dynamical Systems","author":"Prajna Stephen","year":"2004","unstructured":"Stephen Prajna, Antonis Papachristodoulou, and Pablo A Parrilo. 2004. SOSTOOLS: sum of squares optimization toolbox for MATLAB--users guide. Control and Dynamical Systems, California Institute of Technology, Pasadena, CA 91125 (2004)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Bruce Reznick et al. 1978. Extremal PSD forms with few terms. Duke mathematical journal 45 2 (1978) 363--374.","DOI":"10.1215\/S0012-7094-78-04519-2"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.4171\/jems\/620"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/050623802"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1377612.1377619"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2010.05.011"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-017-0121-6"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2017.2706941"},{"key":"e_1_3_2_1_39_1","volume-title":"Sparse sum-of-squares (SOS) optimization: A bridge between DSOS\/SDSOS and SOS optimization for sparse polynomials. arXiv preprint arXiv:1807.05463","author":"Zheng Yang","year":"2018","unstructured":"Yang Zheng, Giovanni Fantuzzi, and Antonis Papachristodoulou. 2018. Sparse sum-of-squares (SOS) optimization: A bridge between DSOS\/SDSOS and SOS optimization for sparse polynomials. arXiv preprint arXiv:1807.05463 (2018)."}],"event":{"name":"ISSAC '19: International Symposium on Symbolic and Algebraic Computation","location":"Beijing China","acronym":"ISSAC '19","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"]},"container-title":["Proceedings of the 2019 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3326229.3326254","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3326229.3326254","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:59Z","timestamp":1750206359000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3326229.3326254"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,8]]},"references-count":38,"alternative-id":["10.1145\/3326229.3326254","10.1145\/3326229"],"URL":"https:\/\/doi.org\/10.1145\/3326229.3326254","relation":{},"subject":[],"published":{"date-parts":[[2019,7,8]]},"assertion":[{"value":"2019-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}