{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:43:29Z","timestamp":1787341409874,"version":"build-2736575974"},"reference-count":78,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/501100009454","name":"Fondation de l'\u00c9cole Polytechnique","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100009454","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100020559","name":"Institut Polytechnique de Paris","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100020559","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2025,6,30]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>Cutting planes are of crucial importance when solving nonconvex nonlinear programs to global optimality, for example using the spatial branch-and-bound algorithms. In this paper, we discuss the generation of cutting planes for signomial programming. Many global optimization algorithms lift signomial programs into an extended formulation such that these algorithms can construct relaxations of the signomial program by outer approximations of the lifted set encoding nonconvex signomial term sets, i.e., hypographs, or epigraphs of signomial terms. We show that any signomial term set can be transformed into the subset of the difference of two concave power functions, from which we derive two kinds of valid linear inequalities. Intersection cuts are constructed using signomial term-free sets which do not contain any point of the signomial term set in their interior. We show that these signomial term-free sets are maximal in the nonnegative orthant, and use them to derive intersection sets. We then convexify a concave power function in the reformulation of the signomial term set, resulting in a convex set containing the signomial term set. This convex outer approximation is constructed in an extended space, and we separate a class of valid linear inequalities by projection from this approximation. We implement the valid inequalities in a global optimization solver and test them on MINLPLib instances. Our results show that both types of valid inequalities provide comparable reductions in running time, number of search nodes, and duality gap.<\/jats:p>","DOI":"10.1137\/23m1599537","type":"journal-article","created":{"date-parts":[[2025,4,28]],"date-time":"2025-04-28T04:01:22Z","timestamp":1745812882000},"page":"899-926","source":"Crossref","is-referenced-by-count":0,"title":["Cutting Planes for Signomial Programming"],"prefix":"10.1137","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0286-1109","authenticated-orcid":true,"given":"Liding","family":"Xu","sequence":"first","affiliation":[{"name":"LIX CNRS, \u00c9cole Polytechnique, Institut Polytechnique de Paris, Palaiseau, 91128 France."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Claudia","family":"D\u2019Ambrosio","sequence":"additional","affiliation":[{"name":"LIX CNRS, \u00c9cole Polytechnique, Institut Polytechnique de Paris, Palaiseau, 91128 France."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[{"name":"LIX CNRS, \u00c9cole Polytechnique, Institut Polytechnique de Paris, Palaiseau, 91128 France."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6390-8882","authenticated-orcid":true,"given":"Sonia","family":"Haddad-Vanier","sequence":"additional","affiliation":[{"name":"LIX CNRS, \u00c9cole Polytechnique, Institut Polytechnique de Paris, Palaiseau, 91128 France, and Universit\u00e9 Paris 1 Panth\u00e9on-Sorbonne, Paris, 75005, France."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0298-1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.2.273"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1090.0439"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72792-7_1"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01908-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.19.1.19"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-014-0073-z"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1080\/10556780902883184"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/17M1117070"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17689-5_1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492913000032"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1080\/10556780903087124"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-023-01345-1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17953-3_6"},{"key":"ref15","unstructured":"S. Bolusani, M. Besan\u00e7on, K. Bestuzheva, A. Chmiela, J. Dion\u00edsio, T. Donkiewicz, J. van Doornmalen, L. Eifler, M. Ghannam, A. Gleixner, C. Graczyk, K. Halbig, I. Hedtke, A. Hoen, C. Hojny, R. van der Hulst, D. Kamp, T. Koch, K. Kofler, J. Lentz, J. Manns, G. Mexi, E. M\u00fchmer, M. Pfetsch, F. Schl\u00f6sser, F. Serrano, Y. Shinano, M. Turner, S. Vigerske, D. Weninger, and L. Xu, The SCIP Optimization Suite 9.0, ZIB Report 24-02-29, Zuse Institute, Berlin, 2024, https:\/\/arxiv.org\/abs\/2402.17702."},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1045-z"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.15.1.114.15159"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-009-9484-1"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/140988978"},{"key":"ref20","unstructured":"R. Chares, Cones and Interior-Point Algorithms for Structured Convex Optimization Involving Powers and Exponentials, Ph.D. thesis, UCL-Universit\u00e9 Catholique de Louvain Louvain-la-Neuve, Belgium, 2009."},{"key":"ref21","first-page":"429","volume":"10","author":"Chen J.-S.","year":"2009","journal-title":"J. Nonlinear Convex Anal."},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11008-0"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.sorms.2011.03.001"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0780-2"},{"key":"ref25","doi-asserted-by":"crossref","unstructured":"A. Costa and L. Liberti, Relaxations of multilinear convex envelopes: Dual is better than primal, in International Symposium on Experimental Algorithms, Springer, 2012, pp. 87\u201398.","DOI":"10.1007\/978-3-642-30850-5_9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-012-0198-8"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68891-4_32"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/21M1462568"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/1012043"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1.3.251"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1189-5"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.09.043"},{"key":"ref33","unstructured":"H. A. Friberg, An exponential cone representation of the general power cone, 2024, https:\/\/optimization-online.org\/2024\/06\/an-exponential-cone-representation-of-the-general-power-cone\/, online; accessed 7, June 2024."},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.1.123"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(69)90017-2"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-022-01131-5"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01541-x"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2021.1162"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56468-0"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2020.0827"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0903-4"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2015.0737"},{"key":"ref43","series-title":"Nonconvex Optim. Appl. 84","first-page":"211","volume-title":"Global Optimization","author":"Liberti L."},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-30528-9"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021924706467"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.06.046"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-016-0418-4"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-018-0626-1"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0616-x"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0606-z"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-012-9877-4"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2017.10.035"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/BF01097059"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/S0098-1354(96)00282-7"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580665"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOGO.0000042112.72379.e6"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0251-3_18"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-014-0166-2"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-013-0396-3"},{"key":"ref60","doi-asserted-by":"crossref","unstructured":"S. Modaresi, M. R. K\u0131l\u0131n\u00e7, and J. P. Vielma, Intersection cuts for nonlinear integer programming: Convexification techniques for structured sets, Math. Program., 155 (2016), pp. 575\u2013611, https:\/\/doi.org\/10.1007\/s10107-015-0866-5.","DOI":"10.1007\/s10107-015-0866-5"},{"key":"ref61","unstructured":"Mosek ApS, MOSEK Modeling Cookbook, 2024, https:\/\/docs.mosek.com\/modeling-cookbook\/index.html, online; accessed 28, May 2024."},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01738-8"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-020-00193-4"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372.ch16"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1138-3"},{"key":"ref66","unstructured":"W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. Flannery, Root finding and nonlinear sets of equations, in Numerical Recipes: The Art of Scientific Computing, Cambridge University Press, New York, 2007, pp. 340\u2013343."},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68279-0_19"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008217604285"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17953-3_29"},{"key":"ref70","unstructured":"F. Serrano Musalem, On Cutting Planes for Mixed-Integer Nonlinear Programming, Doctoral thesis, Technische Universit\u00e4t Berlin, Berlin, 2021."},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2003.12.101"},{"key":"ref72","first-page":"245","volume":"22","author":"Sherali H. D.","year":"1997","journal-title":"Acta Math. Vietnam."},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2017.0846"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0581-4"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0581-8"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1515\/9781400822539"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1080\/02331938508843024"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.10.016"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/23M1599537","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:17:36Z","timestamp":1787339856000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/23M1599537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,28]]},"references-count":78,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6,30]]}},"alternative-id":["10.1137\/23M1599537"],"URL":"https:\/\/doi.org\/10.1137\/23m1599537","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,28]]}}}