{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T18:08:15Z","timestamp":1775671695926,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T00:00:00Z","timestamp":1728259200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T00:00:00Z","timestamp":1728259200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100006919","name":"Massachusetts Institute of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100006919","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Many approaches for addressing global optimization problems typically rely on relaxations of nonlinear constraints over specific mathematical primitives. This is restricting in applications with constraints that are implicit or consist of more general primitives. Trying to address such limitations, Bertsimas and Ozturk (2023) proposed OCTHaGOn as a way of solving very general global optimization problems by approximating the nonlinear constraints using hyperplane-based decision-trees and then using those trees to construct a unified MIO approximation of the original problem. We provide extensions to this approach, by (i) approximating the original problem using other MIO-representable ML models besides decision trees, such as gradient boosted trees, multi layer perceptrons and suport vector machines (ii) proposing adaptive sampling procedures for more accurate ML-based constraint approximations, (iii) utilizing robust optimization to account for the uncertainty of the sample-dependent training of the ML models, (iv) leveraging a family of relaxations to address the infeasibilities of the final MIO approximation. We then test the enhanced framework in 81 global optimization instances. We show improvements in solution feasibility and optimality in the majority of instances. We also compare against BARON, showing improved optimality gaps and solution times in more than 9 instances.\n<\/jats:p>","DOI":"10.1007\/s10898-024-01434-9","type":"journal-article","created":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T06:02:03Z","timestamp":1728280923000},"page":"1-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Global optimization: a machine learning approach"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1985-1003","authenticated-orcid":false,"given":"Dimitris","family":"Bertsimas","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-2530-9860","authenticated-orcid":false,"given":"Georgios","family":"Margaritis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,7]]},"reference":[{"key":"1434_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1287\/ijoc.6.2.207","volume":"6","author":"AS Drud","year":"1994","unstructured":"Drud, A.S.: CONOPT\u2013a large-scale GRG code. ORSA J. Comput. 6, 207\u2013216 (1994)","journal-title":"ORSA J. Comput."},{"key":"1434_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1080\/02331938908843440","volume":"20","author":"R Horst","year":"1989","unstructured":"Horst, R., Thoai, Ng.V., Tuy, H.: On an outer approximation concept in global optimization. Optimization 20, 255\u2013264 (1989)","journal-title":"Optimization"},{"key":"1434_CR3","doi-asserted-by":"publisher","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, 307\u2013339 (1986)","journal-title":"Math. Program."},{"key":"1434_CR4","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/j.compchemeng.2007.03.011","volume":"32","author":"ML Bergamini","year":"2008","unstructured":"Bergamini, M.L., Grossmann, I., Scenna, N., Aguirre, P.: An improved piecewise outer-approximation algorithm for the global optimization of MINLP models involving concave and bilinear terms. Comput. Chem. Eng. 32, 477\u2013493 (2008)","journal-title":"Comput. Chem. Eng."},{"key":"1434_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF00138689","volume":"8","author":"HS Ryoo","year":"1996","unstructured":"Ryoo, H.S., Sahinidis, N.V.: A branch-and-reduce approach to global optimization. J. Global Optim. 8, 107\u2013138 (1996)","journal-title":"J. Global Optim."},{"key":"1434_CR6","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. Global Optim. 59, 503\u2013526 (2014)","journal-title":"J. Global Optim."},{"key":"1434_CR7","doi-asserted-by":"crossref","unstructured":"Bertsimas, D., \u00d6zt\u00fcrk, B.: Global optimization via optimal decision trees. J. Global Optim. (2023)","DOI":"10.1007\/s10898-023-01311-x"},{"key":"1434_CR8","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1007\/s10994-017-5633-9","volume":"106","author":"D Bertsimas","year":"2017","unstructured":"Bertsimas, D., Dunn, J.: Optimal classification trees. Mach. Learn. 106, 1039\u20131082 (2017)","journal-title":"Mach. Learn."},{"key":"1434_CR9","volume-title":"Machine Learning Under a Modern Optimization Lens","author":"D Bertsimas","year":"2019","unstructured":"Bertsimas, D., Dunn, J.: Machine Learning Under a Modern Optimization Lens. Dynamic Ideas LLC, Waltham (2019)"},{"key":"1434_CR10","doi-asserted-by":"crossref","unstructured":"Sun, S., Cao, Z., Zhu, H., Zhao, J.: A survey of optimization methods from a machine learning perspective (2020)","DOI":"10.1109\/TCYB.2019.2950779"},{"key":"1434_CR11","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1016\/j.ejor.2020.08.045","volume":"290","author":"C Gambella","year":"2021","unstructured":"Gambella, C., Ghaddar, B., Naoum-Sawaya, J.: Optimization problems for machine learning: a survey. Eur. J. Oper. Res. 290, 807\u2013828 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"1434_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.cor.2018.04.006","volume":"106","author":"M Fischetti","year":"2019","unstructured":"Fischetti, M., Fraccaro, M.: Machine learning meets mathematical optimization to predict the optimal production of offshore wind parks. Comput. Oper. Res. 106, 289\u2013297 (2019)","journal-title":"Comput. Oper. Res."},{"key":"1434_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104941","volume":"119","author":"B Abbasi","year":"2020","unstructured":"Abbasi, B., Babaei, T., Hosseinifard, Z., Smith-Miles, K., Dehghani, M.: Predicting solutions of large-scale optimization problems via machine learning: a case study in blood supply chain management. Comput. Oper. Res. 119, 104941 (2020)","journal-title":"Comput. Oper. Res."},{"key":"1434_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104781","volume":"113","author":"A Hottung","year":"2020","unstructured":"Hottung, A., Tanaka, S., Tierney, K.: Deep learning assisted heuristic tree search for the container pre-marshalling problem. Comput. Oper. Res. 113, 104781 (2020)","journal-title":"Comput. Oper. Res."},{"key":"1434_CR15","volume-title":"Learning to Branch in Mixed Integer Programming, AAAI\u201916, 724\u2013731","author":"EB Khalil","year":"2016","unstructured":"Khalil, E.B., Bodic, P.L., Song, L., Nemhauser, G., Dilkina, B.: Learning to Branch in Mixed Integer Programming, AAAI\u201916, 724\u2013731. AAAI Press, Phoenix (2016)"},{"key":"1434_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2023.108347","volume":"178","author":"BL Ammari","year":"2023","unstructured":"Ammari, B.L., et al.: Linear model decision trees as surrogates in optimization of engineering applications. Comput. Chem. Eng. 178, 108347 (2023)","journal-title":"Comput. Chem. Eng."},{"key":"1434_CR17","doi-asserted-by":"publisher","first-page":"1605","DOI":"10.1287\/opre.2019.1928","volume":"68","author":"VV Mi\u0161i\u0107","year":"2020","unstructured":"Mi\u0161i\u0107, V.V.: Optimization of Tree Ensembles. Oper. Res. 68, 1605\u20131624 (2020)","journal-title":"Oper. Res."},{"key":"1434_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-020-01474-5","volume":"183","author":"R Anderson","year":"2020","unstructured":"Anderson, R., Huchette, J., Ma, W., Tjandraatmadja, C., Vielma, J.P.: Strong mixed-integer programming formulations for trained neural networks. Math. Program. 183, 3\u201339 (2020)","journal-title":"Math. Program."},{"key":"1434_CR19","doi-asserted-by":"crossref","unstructured":"Maragno, D., et al.: Mixed-Integer Optimization with Constraint Learning. Oper. Res. (2023)","DOI":"10.1287\/opre.2021.0707"},{"key":"1434_CR20","first-page":"1","volume":"23","author":"F Ceccon","year":"2022","unstructured":"Ceccon, F., et al.: OMLT: optimization & machine learning toolkit. J. Mach. Learn. Res. 23, 1\u20138 (2022)","journal-title":"J. Mach. Learn. Res."},{"key":"1434_CR21","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1007\/s11590-016-1028-2","volume":"11","author":"F Boukouvala","year":"2017","unstructured":"Boukouvala, F., Floudas, C.A.: ARGONAUT: Algorithms for global optimization of constrained grey-box computational problems. Optim. Lett. 11, 895\u2013913 (2017)","journal-title":"Optim. Lett."},{"key":"1434_CR22","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1016\/j.compchemeng.2017.02.010","volume":"106","author":"ZT Wilson","year":"2017","unstructured":"Wilson, Z.T., Sahinidis, N.V.: The ALAMO approach to machine learning. Comput. Chem. Eng. 106, 785\u2013795 (2017)","journal-title":"Comput. Chem. Eng."},{"key":"1434_CR23","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF00994018","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support-vector networks. Mach. Learn. 20, 273\u2013297 (1995)","journal-title":"Mach. Learn."},{"key":"1434_CR24","volume-title":"Support Vector Regression Machines, NIPS\u201996, 155\u2013161","author":"H Drucker","year":"1996","unstructured":"Drucker, H., Burges, C.J.C., Kaufman, L., Smola, A., Vapnik, V.: Support Vector Regression Machines, NIPS\u201996, 155\u2013161. MIT Press, Cambridge (1996)"},{"key":"1434_CR25","first-page":"874","volume":"40","author":"L Breiman","year":"1984","unstructured":"Breiman, L., Gordon, A.D., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and regression. Trees 40, 874 (1984)","journal-title":"Trees"},{"key":"1434_CR26","unstructured":"Interpretable AI, L. Interpretable AI Documentation (2023)"},{"key":"1434_CR27","doi-asserted-by":"publisher","first-page":"1103","DOI":"10.1287\/ijoc.2020.0993","volume":"33","author":"M Mistry","year":"2021","unstructured":"Mistry, M., Letsios, D., Krennrich, G., Lee, R.M., Misener, R.: Mixed-integer convex nonlinear optimization with gradient-boosted trees embedded. INFORMS J. Comput. 33, 1103\u20131119 (2021)","journal-title":"INFORMS J. Comput."},{"key":"1434_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2019.106580","volume":"131","author":"B Grimstad","year":"2019","unstructured":"Grimstad, B., Andersson, H.: ReLU networks as surrogate models in mixed-integer linear programs. Comput. Chem. Eng. 131, 106580 (2019)","journal-title":"Comput. Chem. Eng."},{"key":"1434_CR29","doi-asserted-by":"publisher","first-page":"1296","DOI":"10.1287\/opre.32.6.1296","volume":"32","author":"RL Smith","year":"1984","unstructured":"Smith, R.L.: Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions. Oper. Res. 32, 1296\u20131308 (1984)","journal-title":"Oper. Res."},{"key":"1434_CR30","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., Ghaoui, L.E., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)"},{"key":"1434_CR31","unstructured":"Bertsimas, D., Den Hertog, D.: Robust and Adaptive Optimization. Dynamic Ideas. (2022)"},{"key":"1434_CR32","doi-asserted-by":"publisher","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\u2013a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15, 114\u2013119 (2003)","journal-title":"INFORMS J. Comput."},{"key":"1434_CR33","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Global Optim. 8, 201\u2013205 (1996)","journal-title":"J. Global Optim."},{"key":"1434_CR34","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0022-2569(70)90064-9","volume":"5","author":"Jan Golinski","year":"1970","unstructured":"Golinski, Jan: Optimal synthesis problems solved by means of nonlinear programming and random methods. J. Mech. 5, 287\u2013309 (1970)","journal-title":"J. Mech."},{"key":"1434_CR35","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/419043","volume":"2013","author":"M-H Lin","year":"2013","unstructured":"Lin, M.-H., Tsai, J.-F., Hu, N.-Z., Chang, S.-C.: Design optimization of a speed reducer using deterministic techniques. Math. Probl. Eng. 2013, 419043 (2013)","journal-title":"Math. Probl. Eng."},{"key":"1434_CR36","unstructured":"Gurobi General Constraints documentation. https:\/\/www.gurobi.com\/documentation\/current\/refman\/general_constraints.html"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01434-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-024-01434-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01434-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T09:03:48Z","timestamp":1736586228000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-024-01434-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,7]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["1434"],"URL":"https:\/\/doi.org\/10.1007\/s10898-024-01434-9","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,7]]},"assertion":[{"value":"23 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}