{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T08:54:52Z","timestamp":1772614492022,"version":"3.50.1"},"reference-count":91,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T00:00:00Z","timestamp":1708387200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T00:00:00Z","timestamp":1708387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s10589-024-00557-9","type":"journal-article","created":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T21:08:33Z","timestamp":1708463313000},"page":"251-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones"],"prefix":"10.1007","volume":"88","author":[{"given":"David E.","family":"Bernal Neira","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7210-084X","authenticated-orcid":false,"given":"Ignacio E.","family":"Grossmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,20]]},"reference":[{"issue":"1","key":"557_CR1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1051\/ro\/2018036","volume":"53","author":"L Liberti","year":"2019","unstructured":"Liberti, L.: Undecidability and hardness in mixed-integer nonlinear programming. RAIRO-Oper. Res. 53(1), 81\u2013109 (2019)","journal-title":"RAIRO-Oper. Res."},{"issue":"7","key":"557_CR2","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1002\/cite.201400037","volume":"86","author":"F Trespalacios","year":"2014","unstructured":"Trespalacios, F., Grossmann, I.E.: Review of mixed-integer nonlinear and generalized disjunctive programming methods. Chem. Ing. Tec. 86(7), 991\u20131012 (2014)","journal-title":"Chem. Ing. Tec."},{"key":"557_CR3","volume-title":"Mixed Integer Nonlinear Programming","author":"J Lee","year":"2011","unstructured":"Lee, J., Leyffer, S.: Mixed Integer Nonlinear Programming, vol. 154. Springer Science & Business Media, Berlin (2011)"},{"key":"557_CR4","unstructured":"Liberti, L.: Mathematical Programming (Ecole Polytechnique, Paris, 2017). https:\/\/www.lix.polytechnique.fr\/~liberti\/teaching\/dix\/inf580-15\/mathprog.pdf"},{"issue":"1","key":"557_CR5","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01581153","volume":"66","author":"R Fletcher","year":"1994","unstructured":"Fletcher, R., Leyffer, S.: Solving mixed integer nonlinear programs by outer approximation. Math. Program. 66(1), 327\u2013349 (1994)","journal-title":"Math. Program."},{"issue":"2","key":"557_CR6","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s11081-018-9411-8","volume":"20","author":"J Kronqvist","year":"2019","unstructured":"Kronqvist, J., Bernal, D.E., Lundell, A., Grossmann, I.E.: A review and comparison of solvers for convex MINLP. Optim. Eng. 20(2), 397\u2013455 (2019)","journal-title":"Optim. Eng."},{"issue":"3","key":"557_CR7","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1093\/comjnl\/8.3.250","volume":"8","author":"RJ Dakin","year":"1965","unstructured":"Dakin, R.J.: A tree-search algorithm for mixed integer programming problems. Comput. J. 8(3), 250\u2013255 (1965)","journal-title":"Comput. J."},{"issue":"4","key":"557_CR8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"AM Geoffrion","year":"1972","unstructured":"Geoffrion, A.M.: Generalized Benders decomposition. J. Optim. Theory Appl. 10(4), 237\u2013260 (1972)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"557_CR9","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/S0098-1354(97)00000-8","volume":"22","author":"T Westerlund","year":"1998","unstructured":"Westerlund, T., Skrifvars, H., Harjunkoski, I., P\u00f6rn, R.: An extended cutting plane method for a class of non-convex MINLP problems. Comput. Chem. Eng. 22(3), 357\u2013365 (1998)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"557_CR10","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"MA Duran","year":"1986","unstructured":"Duran, M.A., Grossmann, I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36(3), 307\u2013339 (1986)","journal-title":"Math. Program."},{"key":"557_CR11","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on modern convex optimization: analysis, algorithms, and engineering applications","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on modern convex optimization: analysis, algorithms, and engineering applications. SIAM, Philadelphia (2001)"},{"issue":"2","key":"557_CR12","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1287\/moor.2015.0737","volume":"41","author":"F K\u0131l\u0131n\u00e7-Karzan","year":"2016","unstructured":"K\u0131l\u0131n\u00e7-Karzan, F.: On minimal valid inequalities for mixed integer conic programs. Math. Oper. Res. 41(2), 477\u2013510 (2016)","journal-title":"Math. Oper. Res."},{"key":"557_CR13","doi-asserted-by":"crossref","unstructured":"Lubin, M., Zadik, I., Vielma, J.P.: In: International Conference on Integer Programming and Combinatorial Optimization, pp. 392\u2013404. Springer (2017)","DOI":"10.1007\/978-3-319-59250-3_32"},{"issue":"2","key":"557_CR14","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s12532-015-0092-4","volume":"8","author":"HA Friberg","year":"2016","unstructured":"Friberg, H.A.: CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization. Math. Program. Comput. 8(2), 191\u2013214 (2016)","journal-title":"Math. Program. Comput."},{"key":"557_CR15","unstructured":"MOSEK ApS MOSEK Modeling Cookbook (2018)"},{"key":"557_CR16","unstructured":"Domahidi, A., Chu, E., Boyd, S.: In 2013 European Control Conference (ECC), pp. 3071\u20133076. IEEE (2013)"},{"key":"557_CR17","doi-asserted-by":"crossref","first-page":"2686","DOI":"10.1287\/ijoc.2022.1202","volume":"34","author":"C Coey","year":"2022","unstructured":"Coey, C., Kapelevich, L., Vielma, J.P.: Solving natural conic formulations with Hypatia. INFORMS J. Comput. 34, 2686\u20132699 (2022)","journal-title":"INFORMS J. Comput."},{"key":"557_CR18","first-page":"2","volume":"1","author":"RJ Vanderbei","year":"1998","unstructured":"Vanderbei, R.J., Yurttan, H.: Using LOQO to solve second-order cone programming problems. Constraints 1, 2 (1998)","journal-title":"Constraints"},{"key":"557_CR19","unstructured":"Zverovich, V., Fourer, R., Optimization, A.: In: INFORMS Computing Society Conference (2015). http:\/\/ampl.com\/MEETINGS\/TALKS\/2015_01_Richmond_2E.2.pdf"},{"key":"557_CR20","unstructured":"Erickson, J., Fourer, R.: Detection and transformation of second-order cone programming problems in a general-purpose algebraic modeling language. Optim. Online (2019)"},{"key":"557_CR21","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/0-387-30528-9_7","volume-title":"Global Optimization","author":"M Grant","year":"2006","unstructured":"Grant, M., Boyd, S., Ye, Y.: Global Optimization, pp. 155\u2013210. Springer, Berlin (2006)"},{"key":"557_CR22","doi-asserted-by":"crossref","unstructured":"Lubin, M., Yamangil, E., Bent, R., Vielma, J.P.: In: Louveaux, Q., Skutella, M. (eds)Integer Programming and Combinatorial Optimization: 18th International Conference, IPCO 2016, pp. 102\u2013113. Springer, Springer International Publishing (2016)","DOI":"10.1007\/978-3-319-33461-5_9"},{"issue":"1\u20132","key":"557_CR23","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s10107-017-1191-y","volume":"172","author":"M Lubin","year":"2018","unstructured":"Lubin, M., Yamangil, E., Bent, R., Vielma, J.P.: Polyhedral approximation in mixed-integer convex optimization. Math. Program. 172(1\u20132), 139\u2013168 (2018)","journal-title":"Math. Program."},{"key":"557_CR24","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s12532-020-00178-3","volume":"12","author":"C Coey","year":"2020","unstructured":"Coey, C., Lubin, M., Vielma, J.P.: Outer approximation with conic certificates for mixed-integer convex problems. Math. Program. Comput. 12, 249\u2013293 (2020)","journal-title":"Math. Program. Comput."},{"key":"557_CR25","unstructured":"Vigerske, S.: Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming. Ph.D. thesis, Humboldt-Universit\u00e4t zu Berlin, Mathematisch-Naturwissenschaftliche Fakult\u00e4t II (2013)"},{"key":"557_CR26","unstructured":"Bestuzheva, K., Gleixner, A., Vigerske, S.: A Computational Study of Perspective Cuts (2021). arXiv:2103.09573"},{"issue":"3","key":"557_CR27","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s12532-018-0138-5","volume":"10","author":"A Khajavirad","year":"2018","unstructured":"Khajavirad, A., Sahinidis, N.V.: A hybrid LP\/NLP paradigm for global optimization relaxations. Math. Program. Comput. 10(3), 383\u2013421 (2018)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"557_CR28","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10107-010-0360-z","volume":"124","author":"O G\u00fcnl\u00fck","year":"2010","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: Perspective reformulations of mixed integer nonlinear programs with indicator variables. Math. Program. 124(1), 183\u2013205 (2010)","journal-title":"Math. Program."},{"key":"557_CR29","unstructured":"Waltz, R., Platenga, T.: KNITRO user\u2019s manual. 2010 (2017)"},{"key":"557_CR30","doi-asserted-by":"crossref","unstructured":"Belotti, P., Berthold, T., Neves, K.: In: 2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM), pp. 1\u20135. IEEE (2016)","DOI":"10.1109\/SAM.2016.7569658"},{"key":"557_CR31","unstructured":"I.\u00a0Gurobi\u00a0Optimization: Gurobi Optimizer Reference Manual (2016). http:\/\/www.gurobi.com"},{"key":"557_CR32","unstructured":"IBM Corp., IBM, V20.1: User\u2019s Manual for CPLEX. International Business Machines Corporation (2020). https:\/\/www.ibm.com\/docs\/en\/icos\/20.1.0?topic=cplex"},{"key":"557_CR33","doi-asserted-by":"crossref","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming, volume 271 of Graduate Texts in Mathematics (2014)","DOI":"10.1007\/978-3-319-11008-0"},{"key":"557_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-00148-3","volume-title":"Disjunctive Programming","author":"E Balas","year":"2018","unstructured":"Balas, E.: Disjunctive Programming. Springer, Berlin (2018)"},{"issue":"1","key":"557_CR35","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s10107-005-0578-3","volume":"104","author":"MT \u00c7ezik","year":"2005","unstructured":"\u00c7ezik, M.T., Iyengar, G.: Cuts for mixed 0\u20131 conic programming. Math. Program. 104(1), 179\u2013202 (2005)","journal-title":"Math. Program."},{"key":"557_CR36","doi-asserted-by":"crossref","unstructured":"Belotti, P., G\u00f3ez, J.C., P\u00f3lik, I., Ralphs, T.K., Terlaky, T.: In: Numerical Analysis and Optimization, pp. 1\u201335. Springer (2015)","DOI":"10.1007\/978-3-319-17689-5_1"},{"key":"557_CR37","unstructured":"Lodi, A., Tanneau, M., Vielma, J.P.: Disjunctive cuts in mixed-integer conic optimization (2019). arXiv:1912.03166"},{"issue":"1","key":"557_CR38","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10107-015-0891-4","volume":"151","author":"P Bonami","year":"2015","unstructured":"Bonami, P., Lodi, A., Tramontani, A., Wiese, S.: On mathematical programming with indicator constraints. Math. Program. 151(1), 191\u2013223 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"557_CR39","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1023\/A:1025154322278","volume":"26","author":"IE Grossmann","year":"2003","unstructured":"Grossmann, I.E., Lee, S.: Generalized convex disjunctive programming: nonlinear convex hull relaxation. Comput. Optim. Appl. 26(1), 83\u2013100 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"557_CR40","doi-asserted-by":"crossref","unstructured":"Chen, Q., Johnson, E.S., Bernal, D.E., Valentin, R., Kale, S., Bates, J., Siirola, J.D., Grossmann, I.E.: Pyomo. GDP: an ecosystem for logic based modeling and optimization development. Optim. Eng. 1\u201336 (2021)","DOI":"10.1007\/s11081-021-09601-7"},{"issue":"1","key":"557_CR41","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10107-018-1258-4","volume":"177","author":"JP Vielma","year":"2019","unstructured":"Vielma, J.P.: Small and strong formulations for unions of convex sets from the Cayley embedding. Math. Program. 177(1), 21\u201353 (2019)","journal-title":"Math. Program."},{"key":"557_CR42","doi-asserted-by":"crossref","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: In: Mixed Integer Nonlinear Programming, pp. 61\u201389. Springer (2012)","DOI":"10.1007\/978-1-4614-1927-3_3"},{"key":"557_CR43","doi-asserted-by":"crossref","unstructured":"Furman, K.C., Sawaya, N.W., Grossmann, I.E.: A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function. Comput. Optim. Appl. 1\u201326 (2020)","DOI":"10.1007\/s10589-020-00176-0"},{"issue":"2","key":"557_CR44","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s10589-011-9424-0","volume":"52","author":"H Hijazi","year":"2012","unstructured":"Hijazi, H., Bonami, P., Cornu\u00e9jols, G., Ouorou, A.: Mixed-integer nonlinear programs featuring \u201con\/off\u2019\u2019 constraints. Comput. Optim. Appl. 52(2), 537\u2013558 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"9\u201310","key":"557_CR45","doi-asserted-by":"crossref","first-page":"2125","DOI":"10.1016\/S0098-1354(00)00581-0","volume":"24","author":"S Lee","year":"2000","unstructured":"Lee, S., Grossmann, I.E.: New algorithms for nonlinear generalized disjunctive programming. Comput. Chem. Eng. 24(9\u201310), 2125\u20132141 (2000)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"557_CR46","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"RA Stubbs","year":"1999","unstructured":"Stubbs, R.A., Mehrotra, S.: A branch-and-cut method for 0\u20131 mixed convex programming. Math. Program. 86(3), 515\u2013532 (1999)","journal-title":"Math. Program."},{"issue":"2","key":"557_CR47","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0594-3","volume":"106","author":"A Frangioni","year":"2006","unstructured":"Frangioni, A., Gentile, C.: Perspective cuts for a class of convex 0\u20131 mixed integer programs. Math. Program. 106(2), 225\u2013236 (2006)","journal-title":"Math. Program."},{"issue":"3","key":"557_CR48","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.orl.2008.12.009","volume":"37","author":"MS Akt\u00fcrk","year":"2009","unstructured":"Akt\u00fcrk, M.S., Atamt\u00fcrk, A., G\u00fcrel, S.: A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Oper. Res. Lett. 37(3), 187\u2013191 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"7","key":"557_CR49","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/0098-1354(93)E0010-7","volume":"18","author":"R Raman","year":"1994","unstructured":"Raman, R., Grossmann, I.E.: Modelling and computational techniques for logic based integer programming. Comput. Chem. Eng. 18(7), 563\u2013578 (1994)","journal-title":"Comput. Chem. Eng."},{"key":"557_CR50","doi-asserted-by":"crossref","unstructured":"Grossmann, I.E., Ruiz, J.P.: In: Mixed Integer Nonlinear Programming, pp. 93\u2013115. Springer, Berlin (2012)","DOI":"10.1007\/978-1-4614-1927-3_4"},{"key":"557_CR51","unstructured":"Sawaya, N.: Reformulations, relaxations and cutting planes for generalized disjunctive programming. Ph.D. Thesis, Carnegie Mellon University (2006)"},{"issue":"1","key":"557_CR52","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ejor.2011.07.018","volume":"216","author":"N Sawaya","year":"2012","unstructured":"Sawaya, N., Grossmann, I.: A hierarchy of relaxations for linear generalized disjunctive programming. Eur. J. Oper. Res. 216(1), 70\u201382 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"557_CR53","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.ejor.2011.10.002","volume":"218","author":"JP Ruiz","year":"2012","unstructured":"Ruiz, J.P., Grossmann, I.E.: A hierarchy of relaxations for nonlinear convex generalized disjunctive programming. Eur. J. Oper. Res. 218(1), 38\u201347 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"557_CR54","volume-title":"Model Building in Mathematical Programming","author":"HP Williams","year":"2013","unstructured":"Williams, H.P.: Model Building in Mathematical Programming. Wiley, Hoboken (2013)"},{"issue":"3","key":"557_CR55","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s101070050106","volume":"86","author":"S Ceria","year":"1999","unstructured":"Ceria, S., Soares, J.: Convex programming for disjunctive convex optimization. Math. Program. 86(3), 595\u2013614 (1999)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"557_CR56","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10898-016-0401-0","volume":"67","author":"JP Ruiz","year":"2017","unstructured":"Ruiz, J.P., Grossmann, I.E.: Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques. J. Glob. Optim. 67(1\u20132), 43\u201358 (2017)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"557_CR57","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/ijoc.2015.0669","volume":"28","author":"F Trespalacios","year":"2016","unstructured":"Trespalacios, F., Grossmann, I.E.: Cutting plane algorithm for convex generalized disjunctive programs. INFORMS J. Comput. 28(2), 209\u2013222 (2016)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"557_CR58","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10107-018-1301-5","volume":"170","author":"A Atamt\u00fcrk","year":"2018","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Strong formulations for quadratic optimization with M-matrices and indicator variables. Math. Program. 170(1), 141\u2013176 (2018)","journal-title":"Math. Program."},{"issue":"2","key":"557_CR59","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2), 225\u2013249 (2005)","journal-title":"Math. Program."},{"key":"557_CR60","first-page":"3","volume-title":"Annals of Discrete Mathematics","author":"E Balas","year":"1979","unstructured":"Balas, E.: Annals of Discrete Mathematics, vol. 5, pp. 3\u201351. Elsevier, Amsterdam (1979)"},{"issue":"1\u20132","key":"557_CR61","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-016-0998-2","volume":"161","author":"V Chandrasekaran","year":"2017","unstructured":"Chandrasekaran, V., Shah, P.: Relative entropy optimization and its applications. Math. Program. 161(1\u20132), 1\u201332 (2017)","journal-title":"Math. Program."},{"issue":"4","key":"557_CR62","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/S0895479896298130","volume":"18","author":"L El Ghaoui","year":"1997","unstructured":"El Ghaoui, L., Lebret, H.: Robust solutions to least-squares problems with uncertain data. SIAM J. Matrix Anal. Appl. 18(4), 1035\u20131064 (1997)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"557_CR63","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/978-1-4613-0215-5_8","volume-title":"Modeling Languages in Mathematical Optimization","author":"MR Bussieck","year":"2004","unstructured":"Bussieck, M.R., Meeraus, A.: Modeling Languages in Mathematical Optimization, pp. 137\u2013157. Springer, Berlin (2004)"},{"key":"557_CR64","unstructured":"Bussieck, M.R., Drud, A.: SBB: A New Solver for Mixed Integer Nonlinear Programming. Talk, OR (2001)"},{"issue":"1","key":"557_CR65","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","volume":"15","author":"MR Bussieck","year":"2003","unstructured":"Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib-a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15(1), 114\u2013119 (2003)","journal-title":"INFORMS J. Comput."},{"key":"557_CR66","unstructured":"Grossmann, I., Lee, J.: CMU-IBM cyber-infrastructure for MINLP (2021). https:\/\/www.minlp.org\/index.php"},{"issue":"2","key":"557_CR67","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"Bonami, P., Biegler, L.T., Conn, A.R., Cornu\u00e9jols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., W\u00e4chter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discret. Optim. 5(2), 186\u2013204 (2008). https:\/\/doi.org\/10.1016\/j.disopt.2006.10.011","journal-title":"Discret. Optim."},{"issue":"1","key":"557_CR68","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1080\/10556788.2019.1641498","volume":"35","author":"DE Bernal","year":"2020","unstructured":"Bernal, D.E., Vigerske, S., Trespalacios, F., Grossmann, I.E.: Improving the performance of DICOPT in convex MINLP problems using a feasibility pump. Optim. Methods Softw. 35(1), 171\u2013190 (2020)","journal-title":"Optim. Methods Softw."},{"key":"557_CR69","unstructured":"Flaherty, P., Wiratchotisatian, P., Lee, J.A., Tang, Z., Trapp, A.C.: MAP Clustering under the gaussian mixture model via mixed integer nonlinear optimization (2019). arXiv:1911.04285"},{"key":"557_CR70","unstructured":"Chen, Y., Gupta, M.R.: EM Demystified: An Expectation-Maximization Tutorial. Technical Report Number UWEETR-2010-0002 (2010)"},{"key":"557_CR71","unstructured":"Li, Y.F., Tsang, I.W., Kwok, J.T., Zhou, Z.H.: Convex and scalable weakly labeled SVMs. J. Mach. Learn. Res. 14(7) (2013)"},{"issue":"1","key":"557_CR72","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s13675-017-0088-0","volume":"6","author":"DJ Papageorgiou","year":"2018","unstructured":"Papageorgiou, D.J., Trespalacios, F.: Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming. EURO J. Comput. Optim. 6(1), 55\u201383 (2018)","journal-title":"EURO J. Comput. Optim."},{"key":"557_CR73","doi-asserted-by":"crossref","unstructured":"Kronqvist, J., Misener, R., Tsay, C.: Between steps: intermediate relaxations between big-M and convex hull formulations (2021). arXiv:2101.12708","DOI":"10.1007\/978-3-030-78230-6_19"},{"issue":"2","key":"557_CR74","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10898-013-0131-5","volume":"59","author":"MR Bussieck","year":"2014","unstructured":"Bussieck, M.R., Dirkse, S.P., Vigerske, S.: PAVER 2.0: an open source environment for automated performance analysis of benchmarking data. J. Glob. Optim. 59(2), 259\u2013275 (2014)","journal-title":"J. Glob. Optim."},{"key":"557_CR75","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.compchemeng.2015.02.013","volume":"76","author":"F Trespalacios","year":"2015","unstructured":"Trespalacios, F., Grossmann, I.E.: Improved Big-M reformulation for generalized disjunctive programs. Comput. Chem. Eng. 76, 98\u2013103 (2015)","journal-title":"Comput. Chem. Eng."},{"issue":"16","key":"557_CR76","doi-asserted-by":"crossref","first-page":"3762","DOI":"10.1021\/ie010699x","volume":"41","author":"JR Jackson","year":"2002","unstructured":"Jackson, J.R., Grossmann, I.E.: High-level optimization model for the retrofit planning of process networks. Ind. Eng. Chem. Res. 41(16), 3762\u20133770 (2002)","journal-title":"Ind. Eng. Chem. Res."},{"issue":"1","key":"557_CR77","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0169-7439(99)00047-7","volume":"50","author":"R De Maesschalck","year":"2000","unstructured":"De Maesschalck, R., Jouan-Rimbaud, D., Massart, D.L.: The mahalanobis distance. Chemom. Intell. Lab. Syst. 50(1), 1\u201318 (2000)","journal-title":"Chemom. Intell. Lab. Syst."},{"issue":"4\u20135","key":"557_CR78","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/S0098-1354(98)00293-2","volume":"23","author":"A Vecchietti","year":"1999","unstructured":"Vecchietti, A., Grossmann, I.E.: LOGMIP: a disjunctive 0\u20131 non-linear optimizer for process system models. Comput. Chem. Eng. 23(4\u20135), 555\u2013565 (1999)","journal-title":"Comput. Chem. Eng."},{"key":"557_CR79","unstructured":"Mahajan, A., Munson, T.: Exploiting second-order cone structure for global optimization. Argonne Nat. Lab., Lemont, IL, USA, Tech. Rep. ANL\/MCS-P1801-1010 (2010)"},{"issue":"2","key":"557_CR80","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1287\/ijoc.2021.1067","volume":"34","author":"B Legat","year":"2021","unstructured":"Legat, B., Dowson, O., Dias Garcia, J., Lubin, M.: MathOptInterface: a data structure for mathematical optimization problems. INFORMS J. Comput. 34(2), 672\u2013689 (2021). https:\/\/doi.org\/10.1287\/ijoc.2021.1067","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"557_CR81","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","volume":"95","author":"F Alizadeh","year":"2003","unstructured":"Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. 95(1), 3\u201351 (2003)","journal-title":"Math. Program."},{"key":"557_CR82","unstructured":"Chares, R.: Cones and interior-point algorithms for structured convex optimization involving powers andexponentials. Ph.D. Thesis, UCL-Universit\u00e9 Catholique de Louvain, Louvain-la-Neuve, Belgium (2009)"},{"key":"557_CR83","doi-asserted-by":"crossref","unstructured":"Coey, C., Kapelevich, L., Vielma, J.P.: Conic optimization with spectral functions on Euclidean Jordan algebras. Math. Oper. Res. (2022)","DOI":"10.1287\/moor.2022.1324"},{"issue":"2","key":"557_CR84","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10107-002-0350-x","volume":"95","author":"HY Benson","year":"2003","unstructured":"Benson, H.Y., Vanderbei, R.J.: Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming. Math. Program. 95(2), 279\u2013302 (2003)","journal-title":"Math. Program."},{"key":"557_CR85","volume-title":"Fundamentals of Convex Analysis","author":"JB Hiriart-Urruty","year":"2004","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Fundamentals of Convex Analysis. Springer Science & Business Media, Berlin (2004)"},{"issue":"3","key":"557_CR86","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S., et al.: Proximal algorithms. Found. Trends\u00ae Optim. 1(3), 127\u2013239 (2014)","journal-title":"Found. Trends\u00ae Optim."},{"issue":"3","key":"557_CR87","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E Balas","year":"1985","unstructured":"Balas, E.: Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Algebraic Discrete Methods 6(3), 466\u2013486 (1985)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1\u20133","key":"557_CR88","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E Balas","year":"1998","unstructured":"Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discret. Appl. Math. 89(1\u20133), 3\u201344 (1998)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"557_CR89","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1287\/ijoc.1120.0545","volume":"26","author":"H Hijazi","year":"2014","unstructured":"Hijazi, H., Bonami, P., Ouorou, A.: An outer-inner approximation for separable mixed-integer nonlinear programs. INFORMS J. Comput. 26(1), 31\u201344 (2014)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"557_CR90","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1007\/s10898-018-0616-3","volume":"71","author":"J Kronqvist","year":"2018","unstructured":"Kronqvist, J., Lundell, A., Westerlund, T.: Reformulations for utilizing separability when solving convex MINLP problems. J. Glob. Optim. 71(3), 571\u2013592 (2018)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"557_CR91","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(87)90026-6","volume":"17","author":"RG Jeroslow","year":"1987","unstructured":"Jeroslow, R.G.: Representability in mixed integer programming, I: characterization results. Discret. Appl. Math. 17(3), 223\u2013243 (1987)","journal-title":"Discret. Appl. Math."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00557-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00557-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00557-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T00:48:22Z","timestamp":1731372502000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00557-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,20]]},"references-count":91,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["557"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00557-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,20]]},"assertion":[{"value":"3 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}