{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T12:22:24Z","timestamp":1768652544183,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,20]],"date-time":"2020-07-20T00:00:00Z","timestamp":1595203200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["WO 2206\/1-1"],"award-info":[{"award-number":["WO 2206\/1-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,20]]},"DOI":"10.1145\/3373207.3404043","type":"proceedings-article","created":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T14:07:23Z","timestamp":1595858843000},"page":"138-145","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Global optimization via the dual SONC cone and linear programming"],"prefix":"10.1145","author":[{"given":"Mareike","family":"Dressler","sequence":"first","affiliation":[{"name":"University of California"}]},{"given":"Janin","family":"Heuer","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Braunschweig, Braunschweig, Germany"}]},{"given":"Helen","family":"Naumann","sequence":"additional","affiliation":[{"name":"Goethe Universit\u00e4t, Frankfurt, Germany"}]},{"given":"Timo","family":"de Wolff","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Braunschweig, Braunschweig, Germany"}]}],"member":"320","published-online":{"date-parts":[[2020,7,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-019-01422-z"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1080\/23307706.2017.1397554"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(96)00023-5"},{"key":"e_1_3_2_1_4_1","series-title":"MOS-SIAM Series on Optimization","volume-title":"Semidefinite Optimization and Convex Algebraic Geometry","author":"Blekherman G.","year":"2013","unstructured":"Blekherman , G. , Parrilo , P. , and Thomas , R . Semidefinite Optimization and Convex Algebraic Geometry , vol. 13 of MOS-SIAM Series on Optimization . SIAM and the Mathematical Optimization Society, Philadelphia, 2013 . Blekherman, G., Parrilo, P., and Thomas, R. Semidefinite Optimization and Convex Algebraic Geometry, vol. 13 of MOS-SIAM Series on Optimization. SIAM and the Mathematical Optimization Society, Philadelphia, 2013."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-007-9001-7"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/140988978"},{"key":"e_1_3_2_1_7_1","first-page":"83","article-title":"CVXPY: A Python-embedded modeling language for convex optimization","volume":"17","author":"Diamond S.","year":"2016","unstructured":"Diamond , S. , and Boyd , S . CVXPY: A Python-embedded modeling language for convex optimization . Journal of Machine Learning Research 17 , 83 ( 2016 ), 1--5. Diamond, S., and Boyd, S. CVXPY: A Python-embedded modeling language for convex optimization. Journal of Machine Learning Research 17, 83 (2016), 1--5.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_8_1","first-page":"1","article-title":"A Positivstellensatz for Sums of Nonnegative Circuit Polynomials","volume":"1","author":"Dressler M.","year":"2017","unstructured":"Dressler , M. , Iliman , S. , and de Wolff , T . A Positivstellensatz for Sums of Nonnegative Circuit Polynomials . SIAM J. Appl. Algebra Geom. 1 , 1 ( 2017 ), 536--555. Dressler, M., Iliman, S., and de Wolff, T. A Positivstellensatz for Sums of Nonnegative Circuit Polynomials. SIAM J. Appl. Algebra Geom. 1, 1 (2017), 536--555.","journal-title":"SIAM J. Appl. Algebra Geom."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2018.06.018"},{"key":"e_1_3_2_1_10_1","volume-title":"The dual cone of sums of non-negative circuit polynomials","author":"Dressler M.","year":"2018","unstructured":"Dressler , M. , Naumann , H. , and Theobald , T . The dual cone of sums of non-negative circuit polynomials , 2018 . Preprint , arXiv:1809.07648. Dressler, M., Naumann, H., and Theobald, T. The dual cone of sums of non-negative circuit polynomials, 2018. Preprint, arXiv:1809.07648."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00934288"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10884-020-09889-6"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.4169\/math.mag.85.5.334"},{"key":"e_1_3_2_1_14_1","volume-title":"The algebraic boundary of the sonc cone","author":"Forsg\u00e5rd J.","year":"2019","unstructured":"Forsg\u00e5rd , J. , and de Wolff , T. The algebraic boundary of the sonc cone , 2019 . Preprint , arXiv:1905.04776. Forsg\u00e5rd, J., and de Wolff, T. The algebraic boundary of the sonc cone, 2019. Preprint, arXiv:1905.04776."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4771-1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1186\/s40687-016-0052-2"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/140962425"},{"key":"e_1_3_2_1_18_1","volume-title":"A unified framework of SAGE and SONC polynomials and its duality theory","author":"Katth\u00e4n L.","year":"2019","unstructured":"Katth\u00e4n , L. , Naumann , H. , and Theobald , T . A unified framework of SAGE and SONC polynomials and its duality theory , 2019 . Preprint , arXiv:1903.08966. Katth\u00e4n, L., Naumann, H., and Theobald, T. A unified framework of SAGE and SONC polynomials and its duality theory, 2019. Preprint, arXiv:1903.08966."},{"key":"e_1_3_2_1_19_1","first-page":"3","article-title":"Global optimization with polynomials and the problem of moments","volume":"11","author":"Lasserre J","year":"2000","unstructured":"Lasserre , J . Global optimization with polynomials and the problem of moments . SIAM J. Optim. 11 , 3 ( 2000 \/01), 796--817. Lasserre, J. Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 3 (2000\/01), 796--817.","journal-title":"SIAM J. Optim."},{"key":"e_1_3_2_1_20_1","volume-title":"positive polynomials and their applications","author":"Lasserre J.","year":"2010","unstructured":"Lasserre , J. Moments , positive polynomials and their applications . London : Imperial College Press , 2010 . Lasserre, J. Moments, positive polynomials and their applications. London: Imperial College Press, 2010."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107447226"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09686-5_7"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12971-1"},{"key":"e_1_3_2_1_24_1","volume-title":"Newton Polytopes and Relative Entropy Optimization","author":"Murray R.","year":"2018","unstructured":"Murray , R. , Chandrasekaran , V. , and Wierman , A . Newton Polytopes and Relative Entropy Optimization , 2018 . Preprint , arXiv:1810.01614. Murray, R., Chandrasekaran, V., and Wierman, A. Newton Polytopes and Relative Entropy Optimization, 2018. Preprint, arXiv:1810.01614."},{"key":"e_1_3_2_1_25_1","volume-title":"Signomial and Polynomial Optimization via Relative Entropy and Partial Dualization","author":"Murray R.","year":"2019","unstructured":"Murray , R. , Chandrasekaran , V. , and Wierman , A . Signomial and Polynomial Optimization via Relative Entropy and Partial Dualization , 2019 . Preprint , arXiv:1907.00814. Murray, R., Chandrasekaran, V., and Wierman, A. Signomial and Polynomial Optimization via Relative Entropy and Partial Dualization, 2019. Preprint, arXiv:1907.00814."},{"key":"e_1_3_2_1_26_1","volume-title":"Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization","author":"Parrilo P.","year":"2000","unstructured":"Parrilo , P. Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , 2000 . PhD Thesis, California Institute of Technology . Parrilo, P. Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization, 2000. PhD Thesis, California Institute of Technology."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01442738"},{"key":"e_1_3_2_1_28_1","volume-title":"Convex Bodies: the Brunn-Minkowski Theory","author":"Schneider R.","year":"2014","unstructured":"Schneider , R. Convex Bodies: the Brunn-Minkowski Theory . Cambridge University Press , 2014 . Schneider, R. Convex Bodies: the Brunn-Minkowski Theory. Cambridge University Press, 2014."},{"key":"e_1_3_2_1_29_1","volume-title":"An experimental comparison of SONC and SOS certificates for unconstrained optimization","author":"Seidler H.","year":"2018","unstructured":"Seidler , H. , and de Wolff , T. An experimental comparison of SONC and SOS certificates for unconstrained optimization , 2018 . Preprint , arXiv:1808.08431. Seidler, H., and de Wolff, T. An experimental comparison of SONC and SOS certificates for unconstrained optimization, 2018. Preprint, arXiv:1808.08431."},{"key":"e_1_3_2_1_30_1","unstructured":"Seidler H. and de Wolff T. POEM: Effective methods in polynomial optimization version 0.2.1.0. http:\/\/www.iaa.tu-bs.de\/AppliedAlgebra\/POEM\/ jul 2019.  Seidler H. and de Wolff T. POEM: Effective methods in polynomial optimization version 0.2.1.0. http:\/\/www.iaa.tu-bs.de\/AppliedAlgebra\/POEM\/ jul 2019."},{"key":"e_1_3_2_1_31_1","volume-title":"Nonnegative polynomials and circuit polynomials","author":"Wang J.","year":"2018","unstructured":"Wang , J. Nonnegative polynomials and circuit polynomials , 2018 . preprint, arXiv:1804.09455. Wang, J. Nonnegative polynomials and circuit polynomials, 2018. preprint, arXiv:1804.09455."}],"event":{"name":"ISSAC '20: International Symposium on Symbolic and Algebraic Computation","location":"Kalamata Greece","acronym":"ISSAC '20","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"]},"container-title":["Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373207.3404043","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373207.3404043","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:46Z","timestamp":1750203886000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373207.3404043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,20]]},"references-count":31,"alternative-id":["10.1145\/3373207.3404043","10.1145\/3373207"],"URL":"https:\/\/doi.org\/10.1145\/3373207.3404043","relation":{},"subject":[],"published":{"date-parts":[[2020,7,20]]},"assertion":[{"value":"2020-07-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}