{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T18:48:11Z","timestamp":1776106091217,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,3,27]],"date-time":"2018-03-27T00:00:00Z","timestamp":1522108800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,3,27]],"date-time":"2018-03-27T00:00:00Z","timestamp":1522108800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-16-1-2168"],"award-info":[{"award-number":["N00014-16-1-2168"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-16-1-2725"],"award-info":[{"award-number":["N00014-16-1-2725"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10107-018-1246-8","type":"journal-article","created":{"date-parts":[[2018,3,27]],"date-time":"2018-03-27T06:18:51Z","timestamp":1522131531000},"page":"355-393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Error bounds for monomial convexification in polynomial optimization"],"prefix":"10.1007","volume":"175","author":[{"given":"Warren","family":"Adams","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7839-165X","authenticated-orcid":false,"given":"Akshay","family":"Gupte","sequence":"additional","affiliation":[]},{"given":"Yibo","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,27]]},"reference":[{"key":"1246_CR1","unstructured":"Adams, W., Gupte, A., Xu, Y.: An RLT approach for convexifying symmetric multilinear polynomials. Working paper (2017)"},{"issue":"2","key":"1246_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1287\/moor.8.2.273","volume":"8","author":"F Al-Khayyal","year":"1983","unstructured":"Al-Khayyal, F., Falk, J.: Jointly constrained biconvex programming. Math. Oper. Res. 8(2), 273\u2013286 (1983)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1246_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-014-0073-z","volume":"7","author":"X Bao","year":"2015","unstructured":"Bao, X., Khajavirad, A., Sahinidis, N.V., Tawarmalani, M.: Global optimization of nonconvex problems with multilinear intermediates. Math. Program. Comput. 7(1), 1\u201337 (2015)","journal-title":"Math. Program. Comput."},{"issue":"4","key":"1246_CR4","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24(4), 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"key":"1246_CR5","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1016\/j.endm.2010.05.102","volume":"36","author":"P Belotti","year":"2010","unstructured":"Belotti, P., Miller, A.J., Namazifar, M.: Valid inequalities and convex hulls for multilinear functions. Electron. Notes Discrete Math. 36, 805\u2013812 (2010)","journal-title":"Electron. Notes Discrete Math."},{"issue":"4","key":"1246_CR6","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1002\/nav.20011","volume":"51","author":"HP Benson","year":"2004","unstructured":"Benson, H.P.: Concave envelopes of monomial functions over rectangles. Naval Res. Logist. (NRL) 51(4), 467\u2013476 (2004)","journal-title":"Naval Res. Logist. (NRL)"},{"key":"1246_CR7","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s10107-016-1031-5","volume":"162","author":"N Boland","year":"2017","unstructured":"Boland, N., Dey, S.S., Kalinowski, T., Molinaro, M., Rigterink, F.: Bounding the gap between the mccormick relaxation and the convex hull for bilinear functions. Math. Program. 162, 523\u2013535 (2017)","journal-title":"Math. Program."},{"issue":"4","key":"1246_CR8","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s10898-016-0443-3","volume":"67","author":"C Buchheim","year":"2017","unstructured":"Buchheim, C., D\u2019Ambrosio, C.: Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization. J. Glob. Optim. 67(4), 759\u2013786 (2017)","journal-title":"J. Glob. Optim."},{"issue":"6","key":"1246_CR9","doi-asserted-by":"publisher","first-page":"3297","DOI":"10.1137\/090764402","volume":"20","author":"C Buchheim","year":"2010","unstructured":"Buchheim, C., Michaels, D., Weismantel, R.: Integer programming subject to monomial constraints. SIAM J. Optim. 20(6), 3297\u20133311 (2010)","journal-title":"SIAM J. Optim."},{"issue":"1\u20133","key":"1246_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01582138","volume":"61","author":"Y Crama","year":"1993","unstructured":"Crama, Y.: Concave extensions for nonlinear 0\u20131 maximization problems. Math. Program. 61(1\u20133), 53\u201360 (1993)","journal-title":"Math. Program."},{"key":"1246_CR11","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.disopt.2017.02.001","volume":"25","author":"Y Crama","year":"2017","unstructured":"Crama, Y., Rodr\u00edguez-Heck, E.: A class of valid inequalities for multilinear 0\u20131 optimization problems. Discrete Optim. 25, 28\u201347 (2017)","journal-title":"Discrete Optim."},{"key":"1246_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-016-0099-5","volume":"8","author":"E Dalkiran","year":"2016","unstructured":"Dalkiran, E., Sherali, H.D.: RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems. Math. Program. Comput. 8, 1\u201339 (2016)","journal-title":"Math. Program. Comput."},{"issue":"6","key":"1246_CR13","doi-asserted-by":"publisher","first-page":"3104","DOI":"10.1137\/100790835","volume":"20","author":"E De Klerk","year":"2010","unstructured":"De Klerk, E., Laurent, M.: Error bounds for some semidefinite programming approaches to polynomial minimization on the hypercube. SIAM J. Optim. 20(6), 3104\u20133120 (2010)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1246_CR14","doi-asserted-by":"publisher","first-page":"1498","DOI":"10.1137\/140976650","volume":"25","author":"E De Klerk","year":"2015","unstructured":"De Klerk, E., Laurent, M., Sun, Z.: An error analysis for polynomial optimization over the simplex based on the multivariate hypergeometric distribution. SIAM J. Optim. 25(3), 1498\u20131514 (2015)","journal-title":"SIAM J. Optim."},{"key":"1246_CR15","first-page":"1","volume":"162","author":"E De Klerk","year":"2016","unstructured":"De Klerk, E., Laurent, M., Sun, Z.: Convergence analysis for Lasserres measure-based hierarchy of upper bounds for polynomial optimization. Math. Program. 162, 1\u201330 (2016)","journal-title":"Math. Program."},{"key":"1246_CR16","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/moor.2016.0804","volume":"42","author":"A Del Pia","year":"2016","unstructured":"Del Pia, A., Khajavirad, A.: A polyhedral study of binary polynomial programs. Math. Oper. Res. 42, 389\u2013410 (2016)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1246_CR17","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1287\/opre.2015.1357","volume":"63","author":"SS Dey","year":"2015","unstructured":"Dey, S.S., Gupte, A.: Analysis of MILP techniques for the pooling problem. Oper. Res. 63(2), 412\u2013427 (2015)","journal-title":"Oper. Res."},{"issue":"3","key":"1246_CR18","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."},{"key":"1246_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107447226","volume-title":"An Introduction to Polynomial and Semi-algebraic Optimization","author":"JB Lasserre","year":"2015","unstructured":"Lasserre, J.B.: An Introduction to Polynomial and Semi-algebraic Optimization, vol. 52. Cambridge University Press, Cambridge (2015)"},{"key":"1246_CR20","doi-asserted-by":"crossref","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Emerging Applications of Algebraic Geometry, pp. 157\u2013270. Springer (2009)","DOI":"10.1007\/978-0-387-09686-5_7"},{"issue":"2","key":"1246_CR21","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1023\/A:1021924706467","volume":"25","author":"L Liberti","year":"2003","unstructured":"Liberti, L., Pantelides, C.C.: Convex envelopes of monomials of odd degree. J. Glob. Optim. 25(2), 157\u2013168 (2003)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"1246_CR22","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10107-005-0582-7","volume":"103","author":"J Linderoth","year":"2005","unstructured":"Linderoth, J.: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. Math. Program. 103(2), 251\u2013282 (2005)","journal-title":"Math. Program."},{"key":"1246_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-016-0418-4","author":"M Locatelli","year":"2016","unstructured":"Locatelli, M.: Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes. J. Glob. Optim. Online First (2016). \n                    https:\/\/doi.org\/10.1007\/s10898-016-0418-4","journal-title":"J. Glob. Optim. Online First"},{"issue":"1\u20132","key":"1246_CR24","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10107-012-0616-x","volume":"144","author":"M Locatelli","year":"2014","unstructured":"Locatelli, M., Schoen, F.: On convex envelopes for bivariate functions over polytopes. Math. Program. 144(1\u20132), 65\u201391 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"1246_CR25","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10107-012-0606-z","volume":"136","author":"J Luedtke","year":"2012","unstructured":"Luedtke, J., Namazifar, M., Linderoth, J.: Some results on the strength of relaxations of multilinear functions. Math. Program. 136(2), 325\u2013351 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"1246_CR26","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"G McCormick","year":"1976","unstructured":"McCormick, G.: Computability of global solutions to factorable nonconvex programs: part I. Convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976)","journal-title":"Math. Program."},{"issue":"2","key":"1246_CR27","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/B:JOGO.0000042112.72379.e6","volume":"29","author":"C Meyer","year":"2004","unstructured":"Meyer, C., Floudas, C.: Trilinear monomials with mixed sign domains: facets of the convex and concave envelopes. J. Glob. Optim. 29(2), 125\u2013155 (2004)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"1246_CR28","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10107-005-0580-9","volume":"103","author":"C Meyer","year":"2005","unstructured":"Meyer, C., Floudas, C.: Convex envelopes for edge-concave functions. Math. Program. 103(2), 207\u2013224 (2005)","journal-title":"Math. Program."},{"issue":"2\u20133","key":"1246_CR29","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10898-014-0166-2","volume":"59","author":"R Misener","year":"2014","unstructured":"Misener, R., Floudas, C.A.: Antigone: algorithms for continuous\/integer global optimization of nonlinear equations. J. Glob. Optim. 59(2\u20133), 503\u2013526 (2014)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1246_CR30","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1080\/10556788.2014.916287","volume":"30","author":"R Misener","year":"2015","unstructured":"Misener, R., Smadbeck, J.B., Floudas, C.A.: Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2. Optim. Methods Softw. 30(1), 215\u2013249 (2015)","journal-title":"Optim. Methods Softw."},{"issue":"1\u20133","key":"1246_CR31","first-page":"299","volume":"79","author":"JS Pang","year":"1997","unstructured":"Pang, J.S.: Error bounds in mathematical programming. Math. Program. 79(1\u20133), 299\u2013332 (1997)","journal-title":"Math. Program."},{"issue":"4","key":"1246_CR32","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1023\/A:1008217604285","volume":"10","author":"A Rikun","year":"1997","unstructured":"Rikun, A.: A convex envelope formula for multilinear functions. J. Glob. Optim. 10(4), 425\u2013437 (1997)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"1246_CR33","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1023\/A:1011295715398","volume":"19","author":"HS Ryoo","year":"2001","unstructured":"Ryoo, H.S., Sahinidis, N.V.: Analysis of bounds for multilinear functions. J. Glob. Optim. 19(4), 403\u2013424 (2001)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1246_CR34","first-page":"245","volume":"22","author":"H Sherali","year":"1997","unstructured":"Sherali, H.: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets. Acta Math. Vietnam. 22(1), 245\u2013270 (1997)","journal-title":"Acta Math. Vietnam."},{"issue":"3","key":"1246_CR35","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10898-011-9757-3","volume":"52","author":"HD Sherali","year":"2012","unstructured":"Sherali, H.D., Dalkiran, E., Liberti, L.: Reduced RLT representations for nonconvex polynomial programming problems. J. Glob. Optim. 52(3), 447\u2013469 (2012)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"1246_CR36","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1287\/moor.2017.0846","volume":"42","author":"E Speakman","year":"2017","unstructured":"Speakman, E., Lee, J.: Quantifying double McCormick. Math. Oper. Res. 42(4), 1230\u20131253 (2017)","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"1246_CR37","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s10107-012-0581-4","volume":"138","author":"M Tawarmalani","year":"2013","unstructured":"Tawarmalani, M., Richard, J.P.P., Xiong, C.: Explicit convex and concave envelopes through polyhedral subdivisions. Math. Program. 138(1\u20132), 531\u2013577 (2013)","journal-title":"Math. Program."},{"issue":"2","key":"1246_CR38","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-002-0308-z","volume":"93","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.: Convex extensions and envelopes of lower semi-continuous functions. Math. Program. 93(2), 247\u2013263 (2002)","journal-title":"Math. Program."},{"issue":"2","key":"1246_CR39","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2), 225\u2013249 (2005)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1246-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1246-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1246-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:35:54Z","timestamp":1589646954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1246-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,27]]},"references-count":39,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["1246"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1246-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,27]]},"assertion":[{"value":"4 April 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}