{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T02:22:04Z","timestamp":1787451724278,"version":"3.56.0"},"reference-count":89,"publisher":"Springer Science and Business Media LLC","license":[{"start":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T00:00:00Z","timestamp":1787443200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T00:00:00Z","timestamp":1787443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CHE-2108767"],"award-info":[{"award-number":["CHE-2108767"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1926792"],"award-info":[{"award-number":["CMMI-1926792"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Lower bounds play a vital role in optimization by guiding search, improving solution quality, and quantifying optimality gaps. In expensive black-box settings, however, the quality of Lipschitz-based estimated lower bounds can deteriorate when function behavior varies across the domain. To address this limitation, we propose a surrogate-based lower-bound framework that combines surrogate predictions with nonlinear distance metrics. The resulting formulation is designed to provide more informative lower-bound estimates when only a sparse set of function evaluations is available. We study superlinear, linear, and sublinear distance metrics under a H\u00f6lder-type construction and analyze how the choice of metric affects the resulting estimated lower bounds. In particular, we derive a confidence radius that characterizes when the ordering among these bounds is guaranteed. We also introduce an evaluation metric for comparing estimated lower bounds and use it to assess the proposed method against a traditional Lipschitz estimated lower bound and a statistical lower bound based on the Working\u2013Hotelling procedure. Finally, we incorporate the proposed lower bounds as acquisition functions within surrogate optimization. Experiments on benchmark test problems and a planar robot pushing task show that the proposed framework improves lower-bound quality, supports more effective candidate selection, and compares favorably with standard Lipschitz-based, statistical, and six surrogate-optimization baselines.<\/jats:p>","DOI":"10.1007\/s10589-026-00824-x","type":"journal-article","created":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T02:15:28Z","timestamp":1787451328000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Estimating lower bound functions in surrogate optimization"],"prefix":"10.1007","author":[{"given":"Mohammadsina","family":"Almasi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1935-7571","authenticated-orcid":false,"given":"Hadis","family":"Anahideh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jay M.","family":"Rosenberger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,23]]},"reference":[{"key":"824_CR1","doi-asserted-by":"publisher","unstructured":"Floudas, C.A., Pardalos, P.M.: State of the Art in Global Optimization: Computational Methods and Applications. Springer (1996). https:\/\/doi.org\/10.1007\/978-1-4613-3437-8","DOI":"10.1007\/978-1-4613-3437-8"},{"key":"824_CR2","doi-asserted-by":"publisher","unstructured":"Locatelli, M., Schoen, F.: Global Optimization: Theory, Algorithms, and Applications, pp. 125\u2013287. SIAM (2013). https:\/\/doi.org\/10.1137\/1.9781611972672","DOI":"10.1137\/1.9781611972672"},{"key":"824_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1023\/A:1026578104213","volume":"17","author":"WR Esposito","year":"2000","unstructured":"Esposito, W.R., Floudas, C.A.: Deterministic global optimization in nonlinear optimal control problems. J. Glob. Optim. 17, 97\u2013126 (2000)","journal-title":"J. Glob. Optim."},{"key":"824_CR4","first-page":"1","volume":"1","author":"L Liberti","year":"2008","unstructured":"Liberti, L.: Introduction to global optimization. Ecole Polytechnique 1, 1\u201343 (2008)","journal-title":"Ecole Polytechnique"},{"key":"824_CR5","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1007\/s10898-017-0532-y","volume":"71","author":"R Kannan","year":"2018","unstructured":"Kannan, R., Barton, P.I.: Convergence-order analysis of branch-and-bound algorithms for constrained problems. J. Glob. Optim. 71, 753\u2013813 (2018)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"824_CR6","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10957-024-02399-1","volume":"201","author":"W Xu","year":"2024","unstructured":"Xu, W., Jiang, Y., Maddalena, E.T., Jones, C.N.: Lower bounds on the noiseless worst-case complexity of efficient global optimization. J. Optim. Theory Appl. 201(2), 583\u2013608 (2024)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"824_CR7","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/s10898-021-01053-8","volume":"80","author":"B G.-T\u00f3th","year":"2021","unstructured":"G.-T\u00f3th, B., Casado, L.G., Hendrix, E.M., Messine, F.: On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic. J. Glob. Optim. 80(4), 779\u2013804 (2021)","journal-title":"J. Glob. Optim."},{"issue":"7","key":"824_CR8","first-page":"53","volume":"25","author":"S Karhbet","year":"2017","unstructured":"Karhbet, S., Kearfott, R.B.: Range bounds of functions over simplices, for branch and bound algorithms. Reliable Comput. 25(7), 53\u201373 (2017)","journal-title":"Reliable Comput."},{"issue":"1","key":"824_CR9","first-page":"1","volume":"30","author":"D Hand","year":"1981","unstructured":"Hand, D.: Branch and bound in statistical data analysis. J. R. Stat. Soc. Ser. D (The Statistician) 30(1), 1\u201313 (1981)","journal-title":"J. R. Stat. Soc. Ser. D (The Statistician)"},{"key":"824_CR10","doi-asserted-by":"crossref","unstructured":"Gorissen, D., Crombecq, K., Couckuyt, I., Dhaene, T.: Automatic approximation of expensive functions with active learning. In: Foundations of computational, intelligence volume 1: learning and approximation. Springer, pp 35\u201362 (2009)","DOI":"10.1007\/978-3-642-01082-8_2"},{"key":"824_CR11","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10898-016-0494-5","volume":"68","author":"N Martinez","year":"2017","unstructured":"Martinez, N., Anahideh, H., Rosenberger, J.M., Martinez, D., Chen, V.C., Wang, B.P.: Global optimization of non-convex piecewise linear regression splines. J. Glob. Optim. 68, 563\u2013586 (2017)","journal-title":"J. Glob. Optim."},{"key":"824_CR12","first-page":"173","volume":"173","author":"J Van Der Herten","year":"2017","unstructured":"Van Der Herten, J., Van Steenkiste, T., Couckuyt, I., Dhaene, T.: Surrogate modelling with sequential design for expensive simulation applications. Comput. Simul. 173, 173\u2013192 (2017)","journal-title":"Comput. Simul."},{"issue":"3","key":"824_CR13","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s10589-024-00645-w","volume":"90","author":"S Alarie","year":"2025","unstructured":"Alarie, S., Audet, C., Diago, M., Digabel, S.L., Lebeuf, X.: A cost saving algorithm for expensive constrained multi-fidelity blackbox optimization. Comput. Optim. Appl. 90(3), 607\u2013629 (2025)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"824_CR14","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10589-022-00381-z","volume":"83","author":"C Audet","year":"2022","unstructured":"Audet, C., Le Digabel, S., Saltet, R.: Quantifying uncertainty with ensembles of surrogates for blackbox optimization. Comput. Optim. Appl. 83(1), 29\u201366 (2022)","journal-title":"Comput. Optim. Appl."},{"key":"824_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-025-00686-9","author":"K Ma","year":"2025","unstructured":"Ma, K., Rios, L.M., Zheng, H., Sahinidis, N.V., Rajagopalan, S.: Model-and-search: a derivative-free local optimization algorithm. Comput. Optim. Appl. (2025). https:\/\/doi.org\/10.1007\/s10589-025-00686-9","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"824_CR16","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1002\/cpa.21880","volume":"73","author":"L Beck","year":"2020","unstructured":"Beck, L., Mingione, G.: Lipschitz bounds and nonuniform ellipticity. Commun. Pure Appl. Math. 73(5), 944\u20131034 (2020)","journal-title":"Commun. Pure Appl. Math."},{"issue":"1","key":"824_CR17","first-page":"77","volume":"16","author":"P Bubenik","year":"2015","unstructured":"Bubenik, P., et al.: Statistical topological data analysis using persistence landscapes. J. Mach. Learn. Res. 16(1), 77\u2013102 (2015)","journal-title":"J. Mach. Learn. Res."},{"key":"824_CR18","unstructured":"Grill, J.-B., Valko, M., Munos, R.: Black-box optimization of noisy functions with unknown smoothness. In: Advances in Neural Information Processing Systems 28 (NIPS 2015), vol. 28, pp. 1\u20139 (2015)"},{"issue":"23","key":"824_CR19","doi-asserted-by":"publisher","first-page":"17715","DOI":"10.1007\/s00500-020-05030-3","volume":"24","author":"YD Sergeyev","year":"2020","unstructured":"Sergeyev, Y.D., Candelieri, A., Kvasov, D.E., Perego, R.: Safe global optimization of expensive noisy black-box functions in the $$\\delta $$-lipschitz framework. Soft. Comput. 24(23), 17715\u201317735 (2020)","journal-title":"Soft. Comput."},{"key":"824_CR20","doi-asserted-by":"crossref","unstructured":"Kudela, J., Matousek, R.: Combining Lipschitz and RBF surrogate models for high-dimensional computationally expensive problems. arXiv preprint (2022). arXiv:2204.14236","DOI":"10.1016\/j.ins.2022.11.045"},{"key":"824_CR21","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.ins.2022.11.045","volume":"619","author":"J Kudela","year":"2023","unstructured":"Kudela, J., Matou\u0161ek, R.: Combining lipschitz and rbf surrogate models for high-dimensional computationally expensive problems. Inf. Sci. 619, 457\u2013477 (2023)","journal-title":"Inf. Sci."},{"issue":"2","key":"824_CR22","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10898-015-0283-6","volume":"63","author":"H Liu","year":"2015","unstructured":"Liu, H., Xu, S., Ma, Y., Wang, X.: Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces. J. Glob. Optim. 63(2), 229\u2013251 (2015)","journal-title":"J. Glob. Optim."},{"key":"824_CR23","doi-asserted-by":"publisher","unstructured":"Floudas, C.A.: Deterministic Global Optimization: Theory, Methods and Applications, vol. 37. Springer (1999). https:\/\/doi.org\/10.1007\/978-1-4757-4949-6","DOI":"10.1007\/978-1-4757-4949-6"},{"key":"824_CR24","doi-asserted-by":"publisher","unstructured":"Horst, R., Pardalos, P.M.: Handbook of Global Optimization. Springer (2013). https:\/\/doi.org\/10.1007\/978-1-4615-2025-2","DOI":"10.1007\/978-1-4615-2025-2"},{"issue":"4","key":"824_CR25","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1016\/j.compchemeng.2005.11.005","volume":"30","author":"R Karuppiah","year":"2006","unstructured":"Karuppiah, R., Grossmann, I.E.: Global optimization for the synthesis of integrated water systems in chemical processes. Comput. Chem. Eng. 30(4), 650\u2013673 (2006)","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"824_CR26","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10589-023-00466-3","volume":"85","author":"K Ma","year":"2023","unstructured":"Ma, K., Rios, L.M., Bhosekar, A., Sahinidis, N.V., Rajagopalan, S.: Branch-and-model: a derivative-free global optimization algorithm. Comput. Optim. Appl. 85(2), 337\u2013367 (2023)","journal-title":"Comput. Optim. Appl."},{"issue":"10","key":"824_CR27","doi-asserted-by":"publisher","first-page":"1539","DOI":"10.1016\/S0305-0548(02)00082-5","volume":"30","author":"ZB Zabinsky","year":"2003","unstructured":"Zabinsky, Z.B., Smith, R.L., Kristinsdottir, B.P.: Optimal estimation of univariate black-box Lipschitz functions with upper and lower error bounds. Comput. Oper. Res. 30(10), 1539\u20131553 (2003)","journal-title":"Comput. Oper. Res."},{"issue":"1\u20132","key":"824_CR28","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10107-010-0434-y","volume":"133","author":"G Lan","year":"2012","unstructured":"Lan, G.: An optimal method for stochastic composite optimization. Math. Program. 133(1\u20132), 365\u2013397 (2012)","journal-title":"Math. Program."},{"issue":"5","key":"824_CR29","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1002\/nme.511","volume":"55","author":"A Lyamin","year":"2002","unstructured":"Lyamin, A., Sloan, S.: Lower bound limit analysis using non-linear programming. Int. J. Numer. Methods Eng. 55(5), 573\u2013611 (2002)","journal-title":"Int. J. Numer. Methods Eng."},{"issue":"1","key":"824_CR30","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s10107-022-01781-z","volume":"198","author":"SS Dey","year":"2023","unstructured":"Dey, S.S., Dubey, Y., Molinaro, M.: Lower bounds on the size of general branch-and-bound trees. Math. Program. 198(1), 539\u2013559 (2023)","journal-title":"Math. Program."},{"issue":"2","key":"824_CR31","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10898-021-01045-8","volume":"82","author":"J Zhai","year":"2022","unstructured":"Zhai, J., Boukouvala, F.: Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization. J. Glob. Optim. 82(2), 21\u201350 (2022)","journal-title":"J. Glob. Optim."},{"issue":"2\u20133","key":"824_CR32","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":"3","key":"824_CR33","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99(3), 563\u2013591 (2004)","journal-title":"Math. Program."},{"issue":"2","key":"824_CR34","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.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2), 225\u2013249 (2005)","journal-title":"Math. Program."},{"issue":"3","key":"824_CR35","first-page":"255","volume":"2","author":"L Liberti","year":"2004","unstructured":"Liberti, L.: Reformulation and convex relaxation techniques for global optimization. Q. J. Belg. Fr. Ital. Oper. Res. Soc. 2(3), 255\u2013258 (2004)","journal-title":"Q. J. Belg. Fr. Ital. Oper. Res. Soc."},{"key":"824_CR36","doi-asserted-by":"publisher","unstructured":"Rosen, D.M., DuHadway, C., Leonard, J.J.: A convex relaxation for approximate global optimization in simultaneous localization and mapping. In: 2015 IEEE International Conference on Robotics and Automation (ICRA), pp. 5822\u20135829. IEEE (2015). https:\/\/doi.org\/10.1109\/icra.2015.7140014","DOI":"10.1109\/icra.2015.7140014"},{"key":"824_CR37","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1023\/A:1022512411995","volume":"25","author":"LG Casado","year":"2003","unstructured":"Casado, L.G., Mart\u00cdnez, J.A., Garc\u00cda, I., Sergeyev, Y.D.: New interval analysis support functions using gradient information in a global minimization algorithm. J. Glob. Optim. 25, 345\u2013362 (2003)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"824_CR38","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1002\/aic.11101","volume":"53","author":"Y Lin","year":"2007","unstructured":"Lin, Y., Stadtherr, M.A.: Deterministic global optimization of nonlinear dynamic systems. AIChE J. 53(4), 866\u2013875 (2007)","journal-title":"AIChE J."},{"key":"824_CR39","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s001860300280","volume":"58","author":"A Shapiro","year":"2003","unstructured":"Shapiro, A.: Statistical inference of multistage stochastic programming problems. Math. Methods Oper. Res. 58, 57\u201368 (2003)","journal-title":"Math. Methods Oper. Res."},{"key":"824_CR40","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1134\/S0005117913090014","volume":"74","author":"DE Kvasov","year":"2013","unstructured":"Kvasov, D.E., Sergeyev, Y.D.: Lipschitz global optimization methods in control problems. Autom. Remote. Control. 74, 1435\u20131448 (2013)","journal-title":"Autom. Remote. Control."},{"key":"824_CR41","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10898-014-0199-6","volume":"61","author":"C Cartis","year":"2015","unstructured":"Cartis, C., Fowkes, J.M., Gould, N.I.: Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties. J. Glob. Optim. 61, 429\u2013457 (2015)","journal-title":"J. Glob. Optim."},{"key":"824_CR42","doi-asserted-by":"crossref","unstructured":"Pint\u00e9r, J.D.: Global optimization: software, test problems, and applications. In: Handbook of Global Optimization,vol. 2(2), pp. 515\u2013569. Springer (2002)","DOI":"10.1007\/978-1-4757-5362-2_15"},{"issue":"4","key":"824_CR43","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0041-5553(72)90115-2","volume":"12","author":"S Piyavskii","year":"1972","unstructured":"Piyavskii, S.: An algorithm for finding the absolute extremum of a function. USSR Comput. Math. Math. Phys. 12(4), 57\u201367 (1972)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"824_CR44","unstructured":"Sergeyev, Y.D., Kvasov, D.E.: Global search based on efficient diagonal partitions and a set of Lipschitz constants. arXiv preprint (2011). arXiv:1103.2056"},{"issue":"6","key":"824_CR45","doi-asserted-by":"publisher","first-page":"2211","DOI":"10.1002\/aic.14418","volume":"60","author":"A Cozad","year":"2014","unstructured":"Cozad, A., Sahinidis, N.V., Miller, D.C.: Learning surrogate models for simulation-based optimization. AIChE J. 60(6), 2211\u20132227 (2014)","journal-title":"AIChE J."},{"issue":"5","key":"824_CR46","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.1016\/j.cor.2012.08.022","volume":"40","author":"J M\u00fcller","year":"2013","unstructured":"M\u00fcller, J., Shoemaker, C.A., Pich\u00e9, R.: SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems. Comput. Oper. Res. 40(5), 1383\u20131400 (2013)","journal-title":"Comput. Oper. Res."},{"key":"824_CR47","unstructured":"Huang, J.W., Roberts, S.J., Calliess, J.P.: On the sample complexity of Lipschitz constant estimation. Trans. Mach. Learn. Res. (2023)"},{"issue":"2","key":"824_CR48","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s11590-008-0110-9","volume":"3","author":"DE Kvasov","year":"2009","unstructured":"Kvasov, D.E., Sergeyev, Y.D.: A univariate global search working with a set of Lipschitz constants for the first derivative. Optim. Lett. 3(2), 303\u2013318 (2009)","journal-title":"Optim. Lett."},{"key":"824_CR49","unstructured":"Adams, R.A., Fournier, J.J.F.: Sobolev Spaces. Elsevier Science (2003). https:\/\/books.google.com\/books?id=R5A65Koh-EoC"},{"key":"824_CR50","volume":"385","author":"J Wu","year":"2020","unstructured":"Wu, J.: On a linearity between fractal dimension and order of fractional calculus in H\u00f6lder space. Appl. Math. Comput. 385, 125433 (2020)","journal-title":"Appl. Math. Comput."},{"issue":"1\u20133","key":"824_CR51","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/j.cnsns.2014.11.015","volume":"23","author":"D Lera","year":"2015","unstructured":"Lera, D., Sergeyev, Y.D.: Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and H\u00f6lder constants. Commun. Nonlinear Sci. Numer. Simul. 23(1\u20133), 328\u2013342 (2015)","journal-title":"Commun. Nonlinear Sci. Numer. Simul."},{"issue":"4","key":"824_CR52","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1287\/ijoc.2017.0801","volume":"30","author":"Q Fan","year":"2018","unstructured":"Fan, Q., Hu, J.: Surrogate-based promising area search for Lipschitz continuous simulation optimization. INFORMS J. Comput. 30(4), 677\u2013693 (2018)","journal-title":"INFORMS J. Comput."},{"key":"824_CR53","doi-asserted-by":"crossref","unstructured":"Wu, T., Luo, T., Wunsch\u00a0II, D.C.: Lrs: Enhancing adversarial transferability through Lipschitz regularized surrogate. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, pp. 6135\u20136143 (2024)","DOI":"10.1609\/aaai.v38i6.28430"},{"key":"824_CR54","doi-asserted-by":"crossref","unstructured":"Yu, J., Amores, J., Sebe, N., Tian, Q.: A new study on distance metrics as similarity measurement. In: IEEE International Conference on Multimedia and Expo, pp. 533\u2013536. IEEE (2006)","DOI":"10.1109\/ICME.2006.262443"},{"issue":"2","key":"824_CR55","doi-asserted-by":"publisher","first-page":"310","DOI":"10.3846\/1392-8619.2009.15.310-325","volume":"15","author":"R Paulavi\u010dius","year":"2009","unstructured":"Paulavi\u010dius, R., \u017dilinskas, J.: Global optimization using the branch-and-bound algorithm with a combination of Lipschitz bounds over simplices. Technol. Econ. Dev. Econ. 15(2), 310\u2013325 (2009)","journal-title":"Technol. Econ. Dev. Econ."},{"key":"824_CR56","doi-asserted-by":"crossref","unstructured":"Abdelkader, A., Arya, S., Fonseca, G.D., Mount, D.M.: Approximate nearest neighbor searching with non-Euclidean and weighted distances. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 355\u2013372. SIAM (2019)","DOI":"10.1137\/1.9781611975482.23"},{"key":"824_CR57","doi-asserted-by":"publisher","unstructured":"Hansen, P., Jaumard, B.: Lipschitz Optimization. Springer (1995). https:\/\/doi.org\/10.1007\/978-1-4615-2025-2_9","DOI":"10.1007\/978-1-4615-2025-2_9"},{"key":"824_CR58","doi-asserted-by":"publisher","unstructured":"Malherbe, C., Vayatis, N.: Global optimization of Lipschitz functions. In: International Conference on Machine Learning, pp. 2314\u20132323. PMLR (2017). https:\/\/doi.org\/10.48550\/arXiv.1703.02628","DOI":"10.48550\/arXiv.1703.02628"},{"key":"824_CR59","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1137\/20M1380879","volume":"32","author":"AP Vinod","year":"2022","unstructured":"Vinod, A.P., Israel, A., Topcu, U.: Constrained, global optimization of unknown functions with lipschitz continuous gradients. SIAM J. Optim. 32, 1239\u20131264 (2022)","journal-title":"SIAM J. Optim."},{"key":"824_CR60","doi-asserted-by":"crossref","unstructured":"Winter, R., Stein, B., B\u00e4ck, T.: Multi-point acquisition function for constraint parallel efficient multi-objective optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 511\u2013519 (2022)","DOI":"10.1145\/3512290.3528696"},{"key":"824_CR61","doi-asserted-by":"crossref","unstructured":"Wang, H., Stein, B., Emmerich, M., Back, T.: A new acquisition function for Bayesian optimization based on the moment-generating function. In: 2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 507\u2013512. IEEE (2017)","DOI":"10.1109\/SMC.2017.8122656"},{"issue":"12","key":"824_CR62","doi-asserted-by":"publisher","first-page":"2051","DOI":"10.1080\/0305215X.2022.2144273","volume":"55","author":"C Bian","year":"2023","unstructured":"Bian, C., Wang, X., Shao, W., Xin, J., Hu, R., Lu, Y., Liu, H.: Adaptive confidence bound based Bayesian optimization via potentially optimal Lipschitz conditions. Eng. Optim. 55(12), 2051\u20132069 (2023)","journal-title":"Eng. Optim."},{"key":"824_CR63","doi-asserted-by":"crossref","unstructured":"Kim, J., Choi, S.: On local optimizers of acquisition functions in Bayesian optimization. In: Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2020, Ghent, Belgium, 14\u201318 September 2020, Proceedings, Part II, pp. 675\u2013690. Springer (2021)","DOI":"10.1007\/978-3-030-67661-2_40"},{"key":"824_CR64","unstructured":"Agarwal, A., Bottou, L.: A lower bound for the optimization of finite sums. In: International Conference on Machine Learning, pp. 78\u201386. PMLR (2015)"},{"key":"824_CR65","doi-asserted-by":"crossref","unstructured":"Audet, C., Denni, J., Moore, D., Booker, A., Frank, P.: A surrogate-model-based method for constrained optimization. In: 8th Symposium on Multidisciplinary Analysis and Optimization, p. 4891 (2000)","DOI":"10.2514\/6.2000-4891"},{"key":"824_CR66","unstructured":"Chen, E.C., Chen, P.Y., Chung, I., Lee, C.R., et al.: Data-driven Lipschitz continuity: a cost-effective approach to improve adversarial robustness. arXiv preprint (2024). arXiv:2406.19622"},{"key":"824_CR67","unstructured":"Kpotufe, S.: Lipschitz density-ratios, structured data, and data-driven tuning. In: Artificial Intelligence and Statistics, pp. 1320\u20131328. PMLR (2017)"},{"key":"824_CR68","doi-asserted-by":"crossref","unstructured":"Chakrabarty, A., Jha, D.K., Wang, Y.: Data-driven control policies for partially known systems via kernelized Lipschitz learning. In: 2019 American Control Conference (ACC), pp. 4192\u20134197. IEEE (2019)","DOI":"10.23919\/ACC.2019.8815325"},{"key":"824_CR69","doi-asserted-by":"publisher","unstructured":"Jin, Z., Khajenejad, M., Yong, S.Z.: Data-driven model invalidation for unknown Lipschitz continuous systems via abstraction. In: 2020 American Control Conference (ACC), pp. 2975\u20132980. IEEE (2020). https:\/\/doi.org\/10.23919\/acc45564.2020.9147725","DOI":"10.23919\/acc45564.2020.9147725"},{"key":"824_CR70","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10994-019-05833-y","volume":"109","author":"MO Ahmed","year":"2020","unstructured":"Ahmed, M.O., Vaswani, S., Schmidt, M.: Combining Bayesian optimization and Lipschitz optimization. Mach. Learn. 109, 79\u2013102 (2020)","journal-title":"Mach. Learn."},{"issue":"3","key":"824_CR71","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1137\/040621132","volume":"16","author":"YD Sergeyev","year":"2006","unstructured":"Sergeyev, Y.D., Kvasov, D.E.: Global search based on efficient diagonal partitions and a set of lipschitz constants. SIAM J. Optim. 16(3), 910\u2013937 (2006)","journal-title":"SIAM J. Optim."},{"key":"824_CR72","doi-asserted-by":"publisher","unstructured":"Miller, R.G.: Simultaneous Statistical Inference. Springer (2012). https:\/\/doi.org\/10.1007\/978-1-4613-8122-8","DOI":"10.1007\/978-1-4613-8122-8"},{"key":"824_CR73","unstructured":"Surjanovic, S., Bingham, D.: Virtual Library of Simulation Experiments, Test Functions and Datasets (2013). https:\/\/www.sfu.ca\/~ssurjano\/optimization.html. Accessed 18 Apr 2023"},{"key":"824_CR74","unstructured":"Wang, Z., Jegelka, S.: Max-value entropy search for efficient Bayesian optimization. In: International Conference on Machine Learning, pp. 3627\u20133635. PMLR (2017)"},{"key":"824_CR75","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF00229304","volume":"8","author":"G Wood","year":"1996","unstructured":"Wood, G., Zhang, B.: Estimation of the Lipschitz constant of a function. J. Glob. Optim. 8, 91\u2013103 (1996)","journal-title":"J. Glob. Optim."},{"key":"824_CR76","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.na.2015.10.023","volume":"138","author":"N Soave","year":"2016","unstructured":"Soave, N., Tavares, H., Terracini, S., Zilio, A.: H\u00f6lder bounds and regularity of emerging free boundaries for strongly competing schr\u00f6dinger equations with nontrivial grouping. Nonlinear Anal. 138, 388\u2013427 (2016)","journal-title":"Nonlinear Anal."},{"issue":"1\u20133","key":"824_CR77","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.paerosci.2008.11.001","volume":"45","author":"AI Forrester","year":"2009","unstructured":"Forrester, A.I., Keane, A.J.: Recent advances in surrogate-based optimization. Prog. Aerosp. Sci. 45(1\u20133), 50\u201379 (2009)","journal-title":"Prog. Aerosp. Sci."},{"issue":"3","key":"824_CR78","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10898-020-00923-x","volume":"78","author":"D Zhan","year":"2020","unstructured":"Zhan, D., Xing, H.: Expected improvement for expensive optimization: a review. J. Glob. Optim. 78(3), 507\u2013544 (2020)","journal-title":"J. Glob. Optim."},{"key":"824_CR79","doi-asserted-by":"crossref","unstructured":"Winz, J., Engell, S.: Optimization based sampling for gray-box modeling using a modified upper confidence bound acquisition function. In: Computer Aided Chemical Engineering, vol. 50, pp. 953\u2013958. Elsevier (2021)","DOI":"10.1016\/B978-0-323-88506-5.50147-9"},{"key":"824_CR80","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105444","volume":"137","author":"H Anahideh","year":"2022","unstructured":"Anahideh, H., Rosenberger, J., Chen, V.: High-dimensional black-box optimization under uncertainty. Comput. Oper. Res. 137, 105444 (2022)","journal-title":"Comput. Oper. Res."},{"key":"824_CR81","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.asoc.2016.11.009","volume":"50","author":"Y Liu","year":"2017","unstructured":"Liu, Y., Gong, D., Sun, X., Zhang, Y.: Many-objective evolutionary optimization based on reference points. Appl. Soft Comput. 50, 344\u2013355 (2017)","journal-title":"Appl. Soft Comput."},{"issue":"4","key":"824_CR82","doi-asserted-by":"publisher","first-page":"2747","DOI":"10.1109\/TNSE.2022.3169151","volume":"9","author":"J Zhou","year":"2022","unstructured":"Zhou, J., Lv, Y., Wen, C., Wen, G.: Solving specified-time distributed optimization problem via sampled-data-based algorithm. IEEE Trans. Netw. Sci. Eng. 9(4), 2747\u20132758 (2022)","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"824_CR83","first-page":"40","volume":"4","author":"S Arlot","year":"2009","unstructured":"Arlot, S., Celisse, A.: A survey of cross-validation procedures for model selection. Stat. Surv. 4, 40\u201379 (2009)","journal-title":"Stat. Surv."},{"key":"824_CR84","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1023\/A:1008306431147","volume":"13","author":"DR Jones","year":"1998","unstructured":"Jones, D.R., Schonlau, M., Welch, W.J.: Efficient global optimization of expensive black-box functions. J. Glob. Optim. 13, 455\u2013492 (1998)","journal-title":"J. Glob. Optim."},{"issue":"2088","key":"824_CR85","first-page":"3251","volume":"463","author":"AI Forrester","year":"2007","unstructured":"Forrester, A.I., S\u00f3bester, A., Keane, A.J.: Multi-fidelity optimization via surrogate modelling. Proc. R. Soc. Math. Phys. Eng. Sci. 463(2088), 3251\u20133269 (2007)","journal-title":"Proc. R. Soc. Math. Phys. Eng. Sci."},{"key":"824_CR86","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1007\/s00158-019-02248-0","volume":"60","author":"X Song","year":"2019","unstructured":"Song, X., Lv, L., Sun, W., Zhang, J.: A radial basis function-based multi-fidelity surrogate model: exploring correlation between high-fidelity and low-fidelity models. Struct. Multidiscip. Optim. 60, 965\u2013981 (2019)","journal-title":"Struct. Multidiscip. Optim."},{"key":"824_CR87","unstructured":"Wilson, J., Hutter, F., Deisenroth, M.: Maximizing acquisition functions for Bayesian optimization. In: Advances in neural information processing systems, p. 31 (2018)"},{"issue":"1","key":"824_CR88","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1145\/42288.214372","volume":"14","author":"P Bratley","year":"1988","unstructured":"Bratley, P., Fox, B.L.: Algorithm 659: Implementing Sobol\u2019s quasirandom sequence generator. ACM Trans. Math. Softw. (TOMS) 14(1), 88\u2013100 (1988)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"1","key":"824_CR89","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1287\/opre.50.1.42.17798","volume":"50","author":"GB Dantzig","year":"2002","unstructured":"Dantzig, G.B.: Linear programming. Oper. Res. 50(1), 42\u201347 (2002)","journal-title":"Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-026-00824-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-026-00824-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-026-00824-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T02:15:33Z","timestamp":1787451333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-026-00824-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,23]]},"references-count":89,"alternative-id":["824"],"URL":"https:\/\/doi.org\/10.1007\/s10589-026-00824-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,23]]},"assertion":[{"value":"5 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors have no conflict of interest to declare that are relevant to the content of this article. The authors have no financial or proprietary interests in any material discussed in this article. All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}]}}