{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T01:07:21Z","timestamp":1767143241475,"version":"build-2238731810"},"update-to":[{"DOI":"10.1007\/s12532-020-00193-4","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T00:00:00Z","timestamp":1612828800000}}],"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T00:00:00Z","timestamp":1612828800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T00:00:00Z","timestamp":1612828800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s12532-021-00201-1","type":"journal-article","created":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T21:40:40Z","timestamp":1612906840000},"page":"297-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Publisher Correction to: Signomial and polynomial optimization via relative entropy and partial dualization"],"prefix":"10.1007","volume":"13","author":[{"given":"Riley","family":"Murray","sequence":"first","affiliation":[]},{"given":"Venkat","family":"Chandrasekaran","sequence":"additional","affiliation":[]},{"given":"Adam","family":"Wierman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,9]]},"reference":[{"issue":"2","key":"201_CR1","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF00934080","volume":"38","author":"DH Rountree","year":"1982","unstructured":"Rountree, D.H., Rigler, A.K.: A penalty treatment of equality constraints in generalized geometric programming. J. Optim. Theory Appl. 38(2), 169\u2013178 (1982). issn: 1573-2878","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"201_CR2","doi-asserted-by":"publisher","first-page":"965","DOI":"10.2514\/1.C034378","volume":"55","author":"PG Kirschen","year":"2018","unstructured":"Kirschen, P.G., et al.: Application of signomial programming to aircraft design. J. Aircr. 55(3), 965\u2013987 (2018)","journal-title":"J. Aircr."},{"issue":"2","key":"201_CR3","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1108\/03321640710727809","volume":"26","author":"RA Jabr","year":"2007","unstructured":"Jabr, R.A.: Inductor design using signomial programming. COM-PEL Int. J. Comput. Math. Electr. Electron. Eng. 26(2), 461\u2013475 (2007)","journal-title":"COM-PEL Int. J. Comput. Math. Electr. Electron. Eng."},{"key":"201_CR4","doi-asserted-by":"crossref","unstructured":"Chiang, M.: Nonconvex optimization for communication networks. In: Honor of Gilbert Strang, Advances in Applied Mathematics and Global Optimization, Springer US, Boston, pp. 137\u2013196. ISBN: 978-0-387-75714-8 (2009)","DOI":"10.1007\/978-0-387-75714-8_5"},{"issue":"1","key":"201_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0096-3003(03)00200-5","volume":"150","author":"P Shen","year":"2004","unstructured":"Shen, P., Zhang, K.: Global optimization of signomial geometric programming using linear relaxation. Appl. Math. Comput. 150(1), 99\u2013114 (2004)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"201_CR6","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1016\/j.amc.2005.01.142","volume":"168","author":"Y Wang","year":"2005","unstructured":"Wang, Y., Liang, Z.: A deterministic global optimization algorithm for generalized geometric programming. Appl. Math. Comput. 168(1), 722\u2013737 (2005). issn: 0096-3003","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"201_CR7","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/j.amc.2006.05.137","volume":"183","author":"P Shen","year":"2006","unstructured":"Shen, P., Jiao, H.: A new rectangle branch-and-pruning approach for generalized geometric programming. Appl. Math. Comput. 183(2), 1027\u20131038 (2006)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"201_CR8","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1016\/j.amc.2006.05.208","volume":"184","author":"Q Shao-Jian","year":"2007","unstructured":"Shao-Jian, Q., Zhang, K.-C., Ji, Y.: A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation. Appl. Math. Comput. 184(2), 886\u2013894 (2007)","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"201_CR9","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s10898-008-9283-0","volume":"41","author":"P Shen","year":"2008","unstructured":"Shen, P., Ma, Y., Chen, Y.: A robust algorithm for generalized geometric programming. J. Global Optim. 41(4), 593\u2013612 (2008). issn: 1573-2916","journal-title":"J. Global Optim."},{"key":"201_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2014\/158375","volume":"2014","author":"X Hou","year":"2014","unstructured":"Hou, X., Shen, P., Chen, Y.: A global optimization algorithm for signomial geometric programming problem. Abstract Appl. Anal. 2014, 1\u201312 (2014)","journal-title":"Abstract Appl. Anal."},{"issue":"3","key":"201_CR11","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.ejor.2013.10.016","volume":"233","author":"X Gongxian","year":"2014","unstructured":"Gongxian, X.: Global optimization of signomial geometric programming problems. Eur. J. Oper. Res. 233(3), 500\u2013510 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"201_CR12","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/BF01070233","volume":"23","author":"NZ Shor","year":"1987","unstructured":"Shor, N.Z.: Class of global minimum bounds of polynomial functions. Cybernetics 23(6), 731\u2013734 (1987)","journal-title":"Cybernetics"},{"key":"201_CR13","unstructured":"Parrilo, P.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD thesis, California Institute of Technology (2000)"},{"issue":"3","key":"201_CR14","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"201_CR15","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1137\/140988978","volume":"26","author":"V Chandrasekaran","year":"2016","unstructured":"Chandrasekaran, V., Shah, P.: Relative entropy relaxations for signomial optimization. SIAM J. Optim. 26(2), 1147\u20131173 (2016)","journal-title":"SIAM J. Optim."},{"key":"201_CR16","unstructured":"Murray, R., Chandrasekaran, V., Wierman, A.: Newton polytopes and relative entropy optimization (2018). arXiv:1810.01614"},{"key":"201_CR17","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1186\/s40687-016-0052-2","volume":"3","author":"S Iliman","year":"2016","unstructured":"Iliman, S., de Wolff, T.: Amoebas, nonnegative polynomials and sums of squares supported on circuits. Res. Math. Sci. 3, 9 (2016)","journal-title":"Res. Math. Sci."},{"issue":"2","key":"201_CR18","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"KG Murty","year":"1987","unstructured":"Murty, K.G., Kabadi, S.N.: Some NP-complete problems in quadratic and nonlinear programming. Math. Program. 39(2), 117\u2013129 (1987). issn: 1436-4646","journal-title":"Math. Program."},{"key":"201_CR19","unstructured":"MOSEK ApS. MOSEK 9.0.70(beta) (2019)"},{"issue":"3","key":"201_CR20","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/BF01442738","volume":"283","author":"B Reznick","year":"1989","unstructured":"Reznick, B.: Forms derived from the arithmetic-geometric inequality. Math. Ann. 283(3), 431\u2013464 (1989)","journal-title":"Math. Ann."},{"key":"201_CR21","doi-asserted-by":"crossref","unstructured":"P\u00e9bay, P.P., Rojas, J.M., Thompson, D.C.: Optimization and NP R-completeness of certain fewnomials. In: Proceedings of the 2009 Conference on Symbolic Numeric Computation, ACM Press (2009)","DOI":"10.1145\/1577190.1577212"},{"issue":"6","key":"201_CR22","doi-asserted-by":"publisher","first-page":"2153","DOI":"10.3934\/dcdsb.2012.17.2153","volume":"17","author":"C Pantea","year":"2012","unstructured":"Pantea, C., Koeppl, H., Craciun, G.: Global injectivity and multiple equilibria in uni- and bi-molecular reaction networks. Discrete Contin. Dyn. Syst. Ser. B 17(6), 2153\u20132170 (2012)","journal-title":"Discrete Contin. Dyn. Syst. Ser. B"},{"key":"201_CR23","doi-asserted-by":"crossref","unstructured":"August, E., Craciun, G., Koeppl, H.: Finding invariant sets for biological systems using monomial domination. In: 2012 IEEE 51st IEEE Conference on Decision and Control (CDC), IEEE (2012)","DOI":"10.1109\/CDC.2012.6426491"},{"key":"201_CR24","unstructured":"Wang, J.: Nonnegative polynomials and circuit polynomials (2018). arXiv:1804.09455"},{"key":"201_CR25","unstructured":"Katth\u00e4n, L., Naumann, H., Theobald, T.: A unified framework of SAGE and SONC polynomials and its duality theory (2019). arXiv:1903.08966"},{"key":"201_CR26","unstructured":"Seidler, H., de Wolff, T.: An experimental comparison of SONC and SOS certificates for unconstrained optimization (2018). arXiv:1808.08431"},{"key":"201_CR27","unstructured":"Seidler, H., de Wolff, T.: POEM: effective methods in polynomial optimization, version 0.2.1.0(a) (2019). http:\/\/www.iaa.tu-bs.de\/AppliedAlgebra\/POEM\/index.html"},{"issue":"4\u20135","key":"201_CR28","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1080\/10556780802699201","volume":"24","author":"D Henrion","year":"2009","unstructured":"Henrion, D., Lasserre, J.-B., L\u00f6fberg, J.: GloptiPoly 3: moments, optimization and semidefinite programming. Optim. Methods Softw. 24(4\u20135), 761\u2013779 (2009)","journal-title":"Optim. Methods Softw."},{"key":"201_CR29","unstructured":"Papachristodoulou, A., et al.: SOSTOOLS version 3.00 sum of squares optimization toolbox for MATLAB (2013). arXiv:1310.4716"},{"issue":"10","key":"201_CR30","doi-asserted-by":"publisher","first-page":"4677","DOI":"10.1090\/S0002-9947-00-02595-2","volume":"352","author":"V Powers","year":"2000","unstructured":"Powers, V., Reznick, B.: Polynomials that are positive on an interval. Trans. Am. Math. Soc. 352(10), 4677\u20134692 (2000)","journal-title":"Trans. Am. Math. Soc."},{"key":"201_CR31","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-0-387-09686-5_7","volume-title":"Emerging Applications of Algebraic Geometry","author":"M Laurent","year":"2009","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. (eds.) Emerging Applications of Algebraic Geometry, pp. 157\u2013270. Springer, New York (2009). isbn: 978-0-387-09686-5"},{"key":"201_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-31256-9","volume-title":"Convex Analysis and Nonlinear Optimization","author":"J Borwein","year":"2006","unstructured":"Borwein, J., Lewis, A.: Convex Analysis and Nonlinear Optimization. Springer, New York (2006)"},{"key":"201_CR33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107447226","volume-title":"An Introduction to Polynomial and Semi-algebraic OptimizationCambridge Texts in Applied Mathematics","author":"JB Lasserre","year":"2015","unstructured":"Lasserre, J.B.: An Introduction to Polynomial and Semi-algebraic OptimizationCambridge Texts in Applied Mathematics. Cambridge University Press, Cambridge (2015)"},{"key":"201_CR34","doi-asserted-by":"crossref","unstructured":"Powell, M.J.D.: A direct search optimization method that models the objective and constraint functions by linear interpolation. In: Advances in Optimization and Numerical Analysis, Springer, Dordrecht, pp. 51\u201367. ISBN: 978-94-015-8330-5 (1994)","DOI":"10.1007\/978-94-015-8330-5_4"},{"key":"201_CR35","doi-asserted-by":"crossref","unstructured":"Yan, J.: Signomial programs with equality constraints: numerical solution and applications. PhD thesis, University of British Columbia (1976)","DOI":"10.6010\/geoinformatics1975.1976.2_66"},{"issue":"5","key":"201_CR36","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1007\/s11590-019-01422-z","volume":"13","author":"A Agrawal","year":"2019","unstructured":"Agrawal, A., Diamond, S., Boyd, S.: Disciplined geometric programming. Optim. Lett. 13(5), 961\u2013976 (2019)","journal-title":"Optim. Lett."},{"key":"201_CR37","doi-asserted-by":"crossref","unstructured":"Bard, G.V.: Some basic facts about linear algebra over GF(2). In: Algebraic Cryptanalysis, Springer, Berlin, pp. 81\u201388 (2009)","DOI":"10.1007\/978-0-387-88757-9_6"},{"issue":"2","key":"201_CR38","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/317275.317286","volume":"25","author":"J Verschelde","year":"1999","unstructured":"Verschelde, J.: Algorithm 795: PHCpack\u2014a general-purpose solver for polynomial systems by homotopy continuation. ACM Trans. Math. Softw. 25(2), 251\u2013276 (1999). issn: 0098-3500","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"201_CR39","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10898-008-9382-y","volume":"45","author":"S Ray","year":"2008","unstructured":"Ray, S., Nataraj, P.S.V.: An efficient algorithm for range computation of polynomials using the Bernstein form. J. Global Optim. 45(3), 403\u2013426 (2008)","journal-title":"J. Global Optim."},{"issue":"1","key":"201_CR40","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s13675-015-0050-y","volume":"5","author":"JB Lasserre","year":"2017","unstructured":"Lasserre, J.B., Toh, K.-C., Yang, S.: A bounded degree SOS hierarchy for polynomial optimization. EURO J. Comput. Optim. 5(1), 87\u2013117 (2017). issn: 2192- 4414","journal-title":"EURO J. Comput. Optim."},{"issue":"1","key":"201_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-017-0121-6","volume":"10","author":"T Weisser","year":"2018","unstructured":"Weisser, T., Lasserre, J.B., Toh, K.-C.: Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity. Math. Program. Comput. 10(1), 1\u201332 (2018). issn: 1867-2957","journal-title":"Math. Program. Comput."},{"key":"201_CR42","doi-asserted-by":"publisher","unstructured":"Murray, R.: Sageopt 0.5.3 (2020). https:\/\/doi.org\/10.5281\/ZENODO.4017991","DOI":"10.5281\/ZENODO.4017991"},{"key":"201_CR43","doi-asserted-by":"crossref","unstructured":"Domahidi, A., Chu, E., Boyd, S.: ECOS: an SOCP solver for embedded systems. In: European Control Conference (ECC), pp. 3071\u20133076 (2013)","DOI":"10.23919\/ECC.2013.6669541"},{"key":"201_CR44","unstructured":"Serrano, S.A.: Algorithms for unsymmetric cone optimization and an implementation for problems with the exponential cone. PhD Thesis, Stanford University, Palo Alto, CA (2015)"},{"key":"201_CR45","doi-asserted-by":"crossref","unstructured":"Burnell, E., Damen, N.B., Hoburg, W.: GPkit: a human-centered approach to convex optimization in engineering design. In: Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems (2020)","DOI":"10.1145\/3313831.3376412"},{"issue":"2","key":"201_CR46","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF00933404","volume":"26","author":"MJ Rijckaert","year":"1978","unstructured":"Rijckaert, M.J., Martens, X.M.: Comparison of generalized geometric programming algorithms. J. Optim. Theory Appl. 26(2), 205\u2013242 (1978). issn: 1573-2878","journal-title":"J. Optim. Theory Appl."},{"key":"201_CR47","unstructured":"Surjanovic, S., Bingham, D.: Virtual library of simulation experiments: test functions and datasets. Retrieved April 18 from http:\/\/www.sfu.ca\/~ssurjano (2019)"},{"issue":"2","key":"201_CR48","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/18M118935X","volume":"3","author":"AA Ahmadi","year":"2019","unstructured":"Ahmadi, A.A., Majumdar, A.: DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization. SIAM J. Appl. Algebra Geom. 3(2), 193\u2013230 (2019)","journal-title":"SIAM J. Appl. Algebra Geom."},{"key":"201_CR49","unstructured":"Vandenberghe, L.: The CVXOPT linear and quadratic cone program solvers (2010). http:\/\/www.seas.ucla.edu\/~vandenbe\/publications\/coneprog.pdf"},{"key":"201_CR50","unstructured":"Forsg\u00e5rd, J., de Wolff, T.: The algebraic boundary of the sonc cone (2019). arXiv:1905.04776"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-021-00201-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-021-00201-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-021-00201-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,29]],"date-time":"2023-10-29T23:09:11Z","timestamp":1698620951000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-021-00201-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,9]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["201"],"URL":"https:\/\/doi.org\/10.1007\/s12532-021-00201-1","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,9]]},"assertion":[{"value":"9 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}