{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:58:48Z","timestamp":1760061528185,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":44,"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":[{"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"}]},{"name":"Fondation Math\u00e9matique Jacques Hadamard","award":["P-2018-0075"],"award-info":[{"award-number":["P-2018-0075"]}]},{"DOI":"10.13039\/501100008952","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-18-ERC2-0004-01"],"award-info":[{"award-number":["ANR-18-ERC2-0004-01"]}],"id":[{"id":"10.13039\/501100008952","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,8]]},"DOI":"10.1145\/3326229.3326271","type":"proceedings-article","created":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T12:53:20Z","timestamp":1562676800000},"page":"291-298","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Exact Optimization via Sums of Nonnegative Circuits and Arithmetic-geometric-mean-exponentials"],"prefix":"10.1145","author":[{"given":"Victor","family":"Magron","sequence":"first","affiliation":[{"name":"CNRS LAAS, Toulouse, France"}]},{"given":"Henning","family":"Seidler","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Braunschweig, Berlin, Germany"}]},{"given":"Timo","family":"de Wolff","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Braunschweig, Braunschweig, Germany"}]}],"member":"320","published-online":{"date-parts":[[2019,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1108638.1716342"},{"key":"e_1_3_2_1_2_1","volume-title":"Safey El Din","author":"Bank B.","year":"2014","unstructured":"B. Bank, M. Giusti, J. Heintz, and M. Safey El Din. 2014. Intrinsic complexity estimates in polynomial optimization. Journal of Complexity (2014)."},{"volume-title":"Quantifier elimination and cylindrical algebraic decomposition","author":"Basu S.","key":"e_1_3_2_1_3_1","unstructured":"S. Basu, R. Pollack, and M.-F. Roy. 1998. A new algorithm to find a point in every cell defined by a family of polynomials. In Quantifier elimination and cylindrical algebraic decomposition. Springer-Verlag."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-007-9001-7"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","unstructured":"S. Boyd and L. Vandenberghe. 2004. Convex optimization .Cambridge University Press.","DOI":"10.5555\/993483"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/140988978"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","unstructured":"S. Chevillard J. Harrison M. Joldes and C. Lauter. 2011. Efficient and accurate computation of upper bounds of approximation errors. Theoretical Computer Science (2011). 10.1016\/j.tcs.2010.11.052","DOI":"10.1016\/j.tcs.2010.11.052"},{"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","first-page":"1308","article-title":"Amoebas, Nonnegative Polynomials and Sums of Squares Supported on Circuits","volume":"23","author":"de Wolff T.","year":"2015","unstructured":"T. de Wolff. 2015. Amoebas, Nonnegative Polynomials and Sums of Squares Supported on Circuits. Oberwolfach Rep. 23 (2015), 1308--1311.","journal-title":"Oberwolfach Rep."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2946645.3007036"},{"volume-title":"European Control Conference (ECC) . 3071--3076","author":"Domahidi A.","key":"e_1_3_2_1_11_1","unstructured":"A. Domahidi, E. Chu, and S. Boyd. 2013. ECOS: An SOCP solver for embedded systems. In European Control Conference (ECC) . 3071--3076."},{"key":"e_1_3_2_1_12_1","series-title":"SIAM J. Appl. Algebra Geom. (2017)","volume-title":"A Positivstellensatz for Sums of Nonnegative Circuit Polynomials","author":"Dressler M.","unstructured":"M. Dressler, S. Iliman, and T. de Wolff. 2017. A Positivstellensatz for Sums of Nonnegative Circuit Polynomials. SIAM J. Appl. Algebra Geom. (2017)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2018.06.018"},{"key":"e_1_3_2_1_14_1","unstructured":"R.J. Duffin E.L. Peterson and C. Zener. 1967. Geometric programming: Theory and application .John Wiley & Sons Inc. New York-London-Sydney."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/110836869"},{"key":"e_1_3_2_1_16_1","unstructured":"M. Ghasemi and M. Marshall. 2013. Lower Bounds for a Polynomial on a basic closed semialgebraic set using geometric programming. Preprint sf arxiv:1311.3726."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/248979"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(88)80005-1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"T. Hales M. Adams G. Bauer D. T. Dat J. Harrison H. L. Truong C. Kaliszyk V. Magron S. Mclaughlin N. T. Thang N. Q. Truong T. Nipkow S. Obua J. Pleso J. Rute A. Solovyev T. T. H. An T. N. Trung T. T. Diep J. Urban V. K. Ky and R. Zumkeller. 2017. A Formal Proof of the Kepler Conjecture . Forum of Mathematics Pi (2017).","DOI":"10.1017\/fmp.2017.1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1186\/s40687-016-0052-2"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1394042.1394046"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390768.1390792"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400366802"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/05064504X"},{"volume-title":"positive polynomials and their applications","author":"Lasserre J.-B.","key":"e_1_3_2_1_25_1","unstructured":"J.-B. Lasserre. 2010. Moments, positive polynomials and their applications .Imperial College Press, London. xxii"},{"key":"e_1_3_2_1_26_1","unstructured":"361 pages."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"J.-B. Lasserre K.-C. Toh and S. Yang. 2017. A bounded degree SOS hierarchy for polynomial optimization . EURO Journal on Computational Optimization (2017).","DOI":"10.1007\/s13675-015-0050-y"},{"volume-title":"Emerging applications of algebraic geometry. IMA","author":"Laurent M.","key":"e_1_3_2_1_28_1","unstructured":"M. Laurent. 2009. Sums of squares, moment matrices and optimization over polynomials. In Emerging applications of algebraic geometry. IMA Vol. Math. Appl., Vol. 149. Springer, New York, 157--270."},{"key":"e_1_3_2_1_29_1","first-page":"1","article-title":"Formal proofs for Nonlinear Optimization","volume":"8","author":"Magron V.","year":"2015","unstructured":"V. Magron, X. Allamigeon, S. Gaubert, and B. Werner. 2015. Formal proofs for Nonlinear Optimization . Journal of Formalized Reasoning, Vol. 8, 1 (2015), 1--24.","journal-title":"Journal of Formalized Reasoning"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3015465"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3208976.3208986"},{"volume-title":"ISSAC'18: Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation . ACM","author":"Magron V.","key":"e_1_3_2_1_32_1","unstructured":"V. Magron and M. Safey El Din. 2018b. RealCertify: a Maple package for certifying non-negativity . In ISSAC'18: Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation . ACM, New York, NY, USA."},{"key":"e_1_3_2_1_33_1","volume-title":"Safey El Din, and M. Schweighofer","author":"Magron V.","year":"2018","unstructured":"V. Magron, M. Safey El Din, and M. Schweighofer. 2018. Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials. Journal of Symbolic Computation (2018)."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3208976.3208986"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/121448"},{"key":"e_1_3_2_1_36_1","unstructured":"R. Murray V. Chandrasekaran and A. Wierman. 2018. Newton Polytopes and Relative Entropy Optimization. arXiv preprint arXiv:1810.01614 (2018)."},{"volume-title":"Matroid theory","author":"Oxley J.","key":"e_1_3_2_1_37_1","unstructured":"J. Oxley. 2011. Matroid theory second ed.). Oxford Graduate Texts in Mathematics, Vol. 21. Oxford University Press, Oxford."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.09.025"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21945"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1120.0558"},{"key":"e_1_3_2_1_42_1","volume-title":"An Experimental Comparison of SONC and SOS Certificates for Unconstrained Optimization. arXiv preprint arXiv:1808.08431","author":"Seidler H.","year":"2018","unstructured":"H. Seidler and T. de Wolff. 2018. An Experimental Comparison of SONC and SOS Certificates for Unconstrained Optimization. arXiv preprint arXiv:1808.08431 (2018)."},{"key":"e_1_3_2_1_43_1","volume-title":"POEM: Effective Methods in Polynomial Optimization, version 0.2.0.1(a). https:\/\/www3.math.tu-berlin.de\/combi\/RAAGConOpt\/poem.html .","author":"Seidler H.","year":"2019","unstructured":"H. Seidler and T. de Wolff. 2019. POEM: Effective Methods in Polynomial Optimization, version 0.2.0.1(a). https:\/\/www3.math.tu-berlin.de\/combi\/RAAGConOpt\/poem.html ."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/050623802"},{"key":"e_1_3_2_1_45_1","volume-title":"Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity . Mathematical Programming Computation","author":"Weisser T.","year":"2018","unstructured":"T. Weisser, J.-B. Lasserre, and K.-C. Toh. 2018. Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity . Mathematical Programming Computation (2018)."}],"event":{"name":"ISSAC '19: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Beijing China","acronym":"ISSAC '19"},"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.3326271","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3326229.3326271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:00Z","timestamp":1750206360000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3326229.3326271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,8]]},"references-count":44,"alternative-id":["10.1145\/3326229.3326271","10.1145\/3326229"],"URL":"https:\/\/doi.org\/10.1145\/3326229.3326271","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"}}]}}