{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T23:37:43Z","timestamp":1770680263931,"version":"3.49.0"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T00:00:00Z","timestamp":1768953600000},"content-version":"vor","delay-in-days":20,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["239904186"],"award-info":[{"award-number":["239904186"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Technische Universit\u00e4t N\u00fcrnberg"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2026,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In this paper, we consider a finite-dimensional optimization problem minimizing a continuous objective on a compact domain subject to a multi-dimensional constraint function. For the latter, we assume the availability of a global Lipschitz constant. In recent literature, methods based on non-convex outer approximation are proposed for tackling one-dimensional equality constraints that are Lipschitz with respect to the maximum norm. To the best of our knowledge, however, there does not exist a non-convex outer approximation method for a general problem class. We introduce a meta-level solution framework to solve such problems and tackle the underlying theoretical foundations. Considering the feasible domain without the constraint function as manageable, our method relaxes the multidimensional constraint and iteratively refines the feasible region by means of norm-induced cuts, relying on an oracle for the resulting subproblems. We show the method\u2019s correctness and investigate the problem complexity. In order to account for discussions about functionality, limits, and extensions, we present computational examples including illustrations.<\/jats:p>","DOI":"10.1007\/s10898-025-01563-9","type":"journal-article","created":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T08:09:02Z","timestamp":1768982942000},"page":"35-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Norm-induced cuts: outer approximation for Lipschitzian constraint functions"],"prefix":"10.1007","volume":"94","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7144-8657","authenticated-orcid":false,"given":"Adrian","family":"G\u00f6\u00df","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7602-3653","authenticated-orcid":false,"given":"Alexander","family":"Martin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7365-3000","authenticated-orcid":false,"given":"Sebastian","family":"Pokutta","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6736-4827","authenticated-orcid":false,"given":"Kartikey","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,21]]},"reference":[{"issue":"1","key":"1563_CR1","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. In: Mach. Learn. 109(1), 79\u2013102 (2020). https:\/\/doi.org\/10.1007\/s10994-019-05833-y","journal-title":"In: Mach. Learn."},{"issue":"4","key":"1563_CR2","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1137\/S105262340138983X","volume":"14","author":"C Audet","year":"2004","unstructured":"Audet, C., Dennis, J.E., Jr.: A pattern search filter method for nonlinear programming without derivatives. In: SIAM J. Optim. 14(4), 980\u20131010 (2004). https:\/\/doi.org\/10.1137\/S105262340138983X","journal-title":"In: SIAM J. Optim."},{"issue":"1","key":"1563_CR3","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/040603371","volume":"17","author":"C Audet","year":"2006","unstructured":"Audet, C., Dennis, J.E., Jr.: Mesh adaptive direct search algorithms for constrained optimization. In: SIAM J. Optim. 17(1), 188\u2013217 (2006). https:\/\/doi.org\/10.1137\/040603371","journal-title":"In: SIAM J. Optim."},{"key":"1563_CR4","doi-asserted-by":"publisher","unstructured":"Bagirov, A., Karmitsa, N., M\u00e4kel\u00e4, M.M.: Introduction to nonsmooth optimization. Theory, practice and software. Springer, Cham, 2014, xviii+372. https:\/\/doi.org\/10.1007\/978-3-319-08114-4","DOI":"10.1007\/978-3-319-08114-4"},{"key":"1563_CR5","doi-asserted-by":"publisher","unstructured":"Bartholomew-Biggs, M.C., Parkhurst, S.C. Wilson, S.P.: Using DIRECT to solve an aircraft routing problem. Comput. Optim. Appl. 21(3), 311\u2013323.(2002) https:\/\/doi.org\/10.1023\/A:1013729320435","DOI":"10.1023\/A:1013729320435"},{"issue":"2","key":"1563_CR6","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s10898-017-0521-1","volume":"69","author":"A Beck","year":"2017","unstructured":"Beck, A., Pan, D.: A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints. In: J. Global Optim. 69(2), 309\u2013342 (2017). https:\/\/doi.org\/10.1007\/s10898-017-0521-1","journal-title":"In: J. Global Optim."},{"key":"1563_CR7","unstructured":"Berghen, F.V.: CONDOR, a parallel, direct, constrained optimizer for high-computing-load, black box objective functions. In: Proceeedings of the third MIT conference on Computational Fluid and Solid Mechanics, Elsevier. (2005)"},{"key":"1563_CR8","unstructured":"Berthold, T.: Heuristic algorithms in global MINLP solvers. PhD thesis. 366 (2014). http:\/\/www.zib.de\/berthold\/Berthold2014.pdf"},{"issue":"1","key":"1563_CR9","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1287\/opre.1090.0715","volume":"58","author":"D Bertsimas","year":"2010","unstructured":"Bertsimas, D., Nohadani, O., Teo, K.M.: Robust optimization for unconstrained simulation-based problems. In: Oper. Res. 58(1), 161\u2013178 (2010). https:\/\/doi.org\/10.1287\/opre.1090.0715","journal-title":"In: Oper. Res."},{"key":"1563_CR10","doi-asserted-by":"publisher","unstructured":"Bienstock, D., Michalka, A.: Polynomial solvability of variants of the trust-region subproblem. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 380\u2013390 (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.28","DOI":"10.1137\/1.9781611973402.28"},{"issue":"3","key":"1563_CR11","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.ejor.2015.12.018","volume":"252","author":"F Boukouvala","year":"2016","unstructured":"Boukouvala, F., Misener, R., Floudas, C.A.: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO. In: European J. Oper. Res. 252(3), 701\u2013727 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2015.12.018","journal-title":"In: European J. Oper. Res."},{"issue":"2","key":"1563_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10898-015-0352-x","volume":"65","author":"GA Bunin","year":"2016","unstructured":"Bunin, G.A.: Extended reverse-convex programming: an approximate enumeration approach to global optimization. In: J. Global Optim. 65(2), 191\u2013229 (2016). https:\/\/doi.org\/10.1007\/s10898-015-0352-x","journal-title":"In: J. Global Optim."},{"issue":"349","key":"1563_CR13","first-page":"1","volume":"23","author":"F Ceccon","year":"2022","unstructured":"Ceccon, F., Jalving, J., Haddad, J., Thebelt, A., Tsay, C., Laird, C.D., Misener, R.: OMLT: optimization & machine learning toolkit. In: J. Mach. Learn. Res. 23(349), 1\u20138 (2022)","journal-title":"In: J. Mach. Learn. Res."},{"key":"1563_CR14","doi-asserted-by":"publisher","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to derivative-free optimization. 8. MPS\/SIAM Series on Optimization. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA; Mathematical Programming Society (MPS), Philadelphia, PA, xii+277 (2009). https:\/\/doi.org\/10.1137\/1.9780898718768","DOI":"10.1137\/1.9780898718768"},{"key":"1563_CR15","unstructured":"Cui, Y., Pang, J.-S.: Modern nonconvex nondifferentiable optimization. Vol.\u00a029. MOS-SIAM Series on Optimization. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA; Mathematical Optimization Society, Philadelphia, PA, xx+756 (2022)"},{"issue":"2","key":"1563_CR16","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10589-016-9876-3","volume":"65","author":"G Di Pillo","year":"2016","unstructured":"Di Pillo, G., Liuzzi, G., Lucidi, S., Piccialli, V., Rinaldi, F.: A DIRECT-type approach for derivative-free constrained global optimization. In: Comput. Optim. Appl. 65(2), 361\u2013397 (2016). https:\/\/doi.org\/10.1007\/s10589-016-9876-3","journal-title":"In: Comput. Optim. Appl."},{"issue":"3","key":"1563_CR17","doi-asserted-by":"publisher","first-page":"1320","DOI":"10.1111\/itor.12736","volume":"27","author":"Z Drezner","year":"2020","unstructured":"Drezner, Z., Kalczynski, P.: Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming. In: Int. Trans. Oper. Res. 27(3), 1320\u20131342 (2020). https:\/\/doi.org\/10.1111\/itor.12736","journal-title":"In: Int. Trans. Oper. Res."},{"issue":"26","key":"1563_CR18","doi-asserted-by":"publisher","first-page":"9148","DOI":"10.1021\/ie0705094","volume":"46","author":"JA Egea","year":"2007","unstructured":"Egea, J.A., Vries, D., Alonso, A.A., Banga, J.R.: Global Optimization for Integrated Design and Control of Computationally Expensive Process Models. In: Ind. Eng. Chem. Res. 46(26), 9148\u20139157 (2007). https:\/\/doi.org\/10.1021\/ie0705094","journal-title":"In: Ind. Eng. Chem. Res."},{"issue":"1","key":"1563_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/tac.2020.3046193","volume":"67","author":"M Fazlyab","year":"2022","unstructured":"Fazlyab, M., Morari, M., Pappas, G.J.: Safety verification and robustness analysis of neural networks via quadratic constraints and semidefinite programming. In: IEEE Trans. Automat. Control 67(1), 1\u201315 (2022). https:\/\/doi.org\/10.1109\/tac.2020.3046193","journal-title":"In: IEEE Trans. Automat. Control"},{"key":"1563_CR20","unstructured":"Fazlyab, M., Robey, A., Hassani, H., Morari, M., Pappas, G.: Efficient and Accurate Estimation of Lipschitz Constants for Deep Neural Networks. In: Advances in Neural Information Processing Systems. Ed. by H. Wallach, H. Larochelle, A. Beygelzimer, F. d\u2019Alch\u00e9-Buc, E. Fox, and R. Garnett. Vol.\u00a032. Curran Associates, Inc., (2019)"},{"key":"1563_CR21","unstructured":"Floudas, C.A.: Deterministic global optimization: theory, methods and applications. Vol.\u00a037. Springer Science & Business Media, (2013)"},{"key":"1563_CR22","doi-asserted-by":"publisher","unstructured":"Gauvin, J., Dubeau, F.: Differential properties of the marginal function in mathematical programming. In: Math. Programming Stud. 19. Optimality and stability in mathematical programming, 101\u2013119 (1982). https:\/\/doi.org\/10.1007\/bfb0120984","DOI":"10.1007\/bfb0120984"},{"issue":"3","key":"1563_CR23","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1007\/s10957-023-02254-9","volume":"198","author":"J Gr\u00fcbel","year":"2023","unstructured":"Gr\u00fcbel, J., Krug, R., Schmidt, M., Wollner, W.: A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities. In: J. Optim. Theory Appl. 198(3), 1077\u20131117 (2023). https:\/\/doi.org\/10.1007\/s10957-023-02254-9","journal-title":"In: J. Optim. Theory Appl."},{"issue":"1","key":"1563_CR24","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1002\/net.21812","volume":"72","author":"M Gugat","year":"2018","unstructured":"Gugat, M., Leugering, G., Martin, A., Schmidt, M., Sirvent, M., Wintergerst, D.: Towards simulation based mixed-integer optimization with differential equations. In: Networks 72(1), 60\u201383 (2018). https:\/\/doi.org\/10.1002\/net.21812","journal-title":"In: Networks"},{"key":"1563_CR25","unstructured":"Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual. (2023). https:\/\/www.gurobi.com"},{"key":"1563_CR26","unstructured":"Han, Y.: Lecture notes in Informatic-theoretic Lower Bounds in Data Science (Lecture 12). May (2021). https:\/\/web.stanford.edu\/class\/ee378c\/scribe_lec12.pdf"},{"key":"1563_CR27","unstructured":"Hildebrand, R., G\u00f6\u00df, A.: Complexity of Integer Programming in Reverse Convex Sets via Boundary Hyperplane Cover. (2024). arXiv:2409.05308 [math.OC]"},{"key":"1563_CR28","first-page":"263","volume":"49","author":"AJ Hoffman","year":"1952","unstructured":"Hoffman, A.J.: On approximate solutions of systems of linear inequalities. In: J. Research Nat. Bur. Standards 49, 263\u2013265 (1952)","journal-title":"In: J. Research Nat. Bur. Standards"},{"key":"1563_CR29","doi-asserted-by":"publisher","unstructured":"Horst, R., Pardalos, P.\u00a0M.: eds. Handbook of global optimization. Vol.\u00a02. Nonconvex Optimization and its Applications. Kluwer Academic Publishers, Dordrecht, xviii+880 (1995). https:\/\/doi.org\/10.1007\/978-1-4615-2025-2","DOI":"10.1007\/978-1-4615-2025-2"},{"key":"1563_CR30","doi-asserted-by":"publisher","unstructured":"Horst, R., Tuy, H.: Global optimization: Deterministic approaches. Third. Heidelberg: Springer Berlin, (1996). https:\/\/doi.org\/10.1007\/978-3-662-03199-5","DOI":"10.1007\/978-3-662-03199-5"},{"key":"1563_CR31","doi-asserted-by":"publisher","unstructured":"Jacobsen, S.E.: Reverse convex optimization. In: Encyclopedia of Optimization. Ed. by Floudas, C.A., Pardalos, P.M. Boston, M.A.: Springer US, 3295\u20133300, (2009). https:\/\/doi.org\/10.1007\/978-0-387-74759-0_564","DOI":"10.1007\/978-0-387-74759-0_564"},{"key":"1563_CR32","unstructured":"Jordan, M., Dimakis, A.G.: Exactly Computing the Local Lipschitz Constant of ReLU Networks. In: Advances in Neural Information Processing Systems. Ed. by H. Larochelle, M. Ranzato, R. Hadsell, M. Balcan, and H. Lin. Vol.\u00a033. Curran Associates, Inc., 7344\u20137353 (2020)"},{"issue":"4","key":"1563_CR33","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1007\/s11590-021-01731-2","volume":"16","author":"P Kalczynski","year":"2022","unstructured":"Kalczynski, P., Drezner, Z.: Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location. In: Optim. Lett. 16(4), 1153\u20131166 (2022). https:\/\/doi.org\/10.1007\/s11590-021-01731-2","journal-title":"In: Optim. Lett."},{"key":"1563_CR34","doi-asserted-by":"publisher","unstructured":"Koch, T., Hiller, B., Pfetsch, M.E., Schewe, L.: Evaluating gas network capacities. Philadelphia: SIAM (2015). https:\/\/doi.org\/10.1137\/1.9781611973693","DOI":"10.1137\/1.9781611973693"},{"key":"1563_CR35","doi-asserted-by":"crossref","unstructured":"Kolmogorov, A.N., Tihomirov, V.M.: $$\\varepsilon $$-entropy and $$\\varepsilon $$-capacity of sets in functional space. In: Amer. Math. Soc. Transl. 17 (2), 277\u2013364 (1961)","DOI":"10.1090\/trans2\/017\/10"},{"key":"1563_CR36","doi-asserted-by":"publisher","unstructured":"Kronqvist, J., Misener, R., Tsay, C.: Between Steps: Intermediate Relaxations Between Big-M and Convex Hull Formulations. In: Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Ed. by P.\u00a0J. Stuckey. Cham: Springer International Publishing, 299\u2013314 (2021). https:\/\/doi.org\/10.1007\/978-3-030-78230-6_19","DOI":"10.1007\/978-3-030-78230-6_19"},{"key":"1563_CR37","unstructured":"Latorre, F., Rolland, P., Cevher,V.: Lipschitz constant estimation of Neural Networks via sparse polynomial optimization. (2020). arXiv: 2004.08688 [cs.LG]"},{"key":"1563_CR38","doi-asserted-by":"publisher","unstructured":"Lewis, R.\u00a0M., Torczon, V.: Pattern search algorithms for bound constrained minimization. In: SIAM J. Optim. 9(4) (1999). Dedicated to John E. Dennis, Jr., on his 60th birthday, pp.\u00a01082\u20131099. https:\/\/doi.org\/10.1137\/S1052623496300507","DOI":"10.1137\/S1052623496300507"},{"key":"1563_CR39","doi-asserted-by":"publisher","unstructured":"Liuzzi, G., Lucidi, S., Piccialli, V.: A partition-based global optimization algorithm. In: J. Global Optim. 48(1), 113\u2013128 (2010). https:\/\/doi.org\/10.1007\/s10898-009-9515-y","DOI":"10.1007\/s10898-009-9515-y"},{"key":"1563_CR40","unstructured":"Malherbe, C., Vayatis. N.: Global optimization of Lipschitz functions. In: Proceedings of the 34th International Conference on Machine Learning. Ed. by Precup, D., Teh, Y.W. Vol.\u00a070. Proceedings of Machine Learning Research. PMLR, 2314\u20132323 (2017). https:\/\/proceedings.mlr.press\/v70\/malherbe17a.html"},{"key":"1563_CR41","doi-asserted-by":"publisher","unstructured":"Misener, R., Floudas. C.A.: Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations. In: Math. Program. 136(1), 155\u2013182 (2012). https:\/\/doi.org\/10.1007\/s10107-012-0555-6","DOI":"10.1007\/s10107-012-0555-6"},{"key":"1563_CR42","doi-asserted-by":"publisher","unstructured":"Misener, R., Floudas. C.A.: GloMIQO: global mixed-integer quadratic optimizer. In: J. Global Optim. 57(1) , 3\u201350 (2013). https:\/\/doi.org\/10.1007\/s10898-012-9874-7","DOI":"10.1007\/s10898-012-9874-7"},{"issue":"3","key":"1563_CR43","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. In: INFORMS J. Comput. 33(3), 1103\u20131119 (2021). https:\/\/doi.org\/10.1287\/ijoc.2020.0993","journal-title":"In: INFORMS J. Comput."},{"key":"1563_CR44","doi-asserted-by":"publisher","unstructured":"Molan, I., Schmidt, M.: Using neural networks to solve linear bilevel problems with unknown lower level. In: Optim. Lett. 17(5), 1083\u20131103 (2023). https:\/\/doi.org\/10.1007\/s11590-022-01958-7","DOI":"10.1007\/s11590-022-01958-7"},{"key":"1563_CR45","volume-title":"Problem complexity and method efficiency in optimization","author":"AS Nemirovskij","year":"1983","unstructured":"Nemirovskij, A.S., Yudin, D.B.: Problem complexity and method efficiency in optimization. Wiley-Interscience, Norwich (1983)"},{"key":"1563_CR46","doi-asserted-by":"publisher","unstructured":"Ortega, J.M., Rheinboldt, W.C.: Iterative solution of nonlinear equations in several variables. Vol.\u00a030. Classics in Applied Mathematics. Reprint of the 1970 original. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, , xxvi+572 (2000). https:\/\/doi.org\/10.1137\/1.9780898719468","DOI":"10.1137\/1.9780898719468"},{"issue":"5","key":"1563_CR47","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.2514\/1.J058724","volume":"59","author":"B \u00d6zt\u00fcrk","year":"2021","unstructured":"\u00d6zt\u00fcrk, B., Saab, A.: Optimal Aircraft Design Decisions Under Uncertainty Using Robust Signomial Programming. In: AIAA Journal 59(5), 1773\u20131785 (2021). https:\/\/doi.org\/10.2514\/1.J058724","journal-title":"In: AIAA Journal"},{"key":"1563_CR48","doi-asserted-by":"publisher","unstructured":"Paulavi\u010dius, R., \u017dilinskas, J.: Simplicial partitions in global optimization. In: Simplicial Global Optimization. SpringerBriefs in Optimization. Springer, New York, x+137 (2014). https:\/\/doi.org\/10.1007\/978-1-4614-9093-7","DOI":"10.1007\/978-1-4614-9093-7"},{"key":"1563_CR49","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1109\/lcsys.2021.3050444","volume":"6","author":"P Pauli","year":"2022","unstructured":"Pauli, P., Koch, A., Berberich, J., Kohler, P., Allg\u00f6wer, F.: Training robust neural networks using Lipschitz bounds. IEEE Control Syst. Lett. 6, 121\u2013126 (2022). https:\/\/doi.org\/10.1109\/lcsys.2021.3050444","journal-title":"IEEE Control Syst. Lett."},{"issue":"4","key":"1563_CR50","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. In: USSR Computational Mathematics and Mathematical Physics 12(4), 57\u201367 (1972). https:\/\/doi.org\/10.1016\/0041-5553(72)90115-2","journal-title":"In: USSR Computational Mathematics and Mathematical Physics"},{"key":"1563_CR51","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1016\/j.jcp.2018.10.045","volume":"378","author":"M Raissi","year":"2019","unstructured":"Raissi, M., Perdikaris, P., Karniadakis, G.E.: Physics-informed neural networks: a deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations. In: J. Comput. Phys. 378, 686\u2013707 (2019). https:\/\/doi.org\/10.1016\/j.jcp.2018.10.045","journal-title":"In: J. Comput. Phys."},{"key":"1563_CR52","unstructured":"Rudin, W.: Principles of mathematical analysis. Third. International Series in Pure and Applied Mathematics. McGraw-Hill Book Co., New York-Auckland-D\u00fcsseldorf, x+342 (1976)"},{"issue":"1\u20132","key":"1563_CR53","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s10107-018-1309-x","volume":"178","author":"M Schmidt","year":"2019","unstructured":"Schmidt, M., Sirvent, M., Wollner, W.: A decomposition method for MINLPs with Lipschitz continuous nonlinearities. In: Math. Program. 178(1\u20132), 449\u2013483 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1309-x","journal-title":"In: Math. Program."},{"issue":"5","key":"1563_CR54","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1007\/s11590-021-01827-9","volume":"16","author":"M Schmidt","year":"2022","unstructured":"Schmidt, M., Sirvent, M., Wollner, W.: The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities. In: Optim. Lett. 16(5), 1355\u20131372 (2022). https:\/\/doi.org\/10.1007\/s11590-021-01827-9","journal-title":"In: Optim. Lett."},{"key":"1563_CR55","doi-asserted-by":"publisher","unstructured":"Sergeyev, Y.D., Kvasov, D.E.: Deterministic global optimization. SpringerBriefs in Optimization. An introduction to the diagonal approach. Springer, New York, x+136 (2017). https:\/\/doi.org\/10.1007\/978-1-4939-7199-2","DOI":"10.1007\/978-1-4939-7199-2"},{"key":"1563_CR56","unstructured":"Still, G.: Lectures on Parametric Optimization: An Introduction. The Netherlands: University of Twente, (2018). https:\/\/optimization-online.org\/2018\/04\/6587\/"},{"issue":"16","key":"1563_CR57","doi-asserted-by":"publisher","first-page":"11853","DOI":"10.1007\/s00500-020-05078-1","volume":"24","author":"R Strongin","year":"2020","unstructured":"Strongin, R., Barkalov, K., Bevzuk, S.: Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints. In: Soft. Comput. 24(16), 11853\u201311865 (2020). https:\/\/doi.org\/10.1007\/s00500-020-05078-1","journal-title":"In: Soft. Comput."},{"issue":"5","key":"1563_CR58","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1080\/02331938808843381","volume":"19","author":"NV Thoai","year":"1988","unstructured":"Thoai, N.V.: A modified version of Tuy\u2019s method for solving d.c. programming problems. In: Optimization 19(5), 665\u2013674 (1988). https:\/\/doi.org\/10.1080\/02331938808843381","journal-title":"In: Optimization"},{"key":"1563_CR59","unstructured":"Tsay, C., Kronqvist, J., Thebelt, A., Misener, R.: Partition-Based Formulations for Mixed-Integer Optimization of Trained ReLU Neural Networks. In: Advances in Neural Information Processing Systems. Ed. by Ranzato, M., Beygelzimer, A., Dauphin, Y., Liang, P., Vaughan, J.W. Curran Associates, Inc., 34, 3068\u20133080 (2021)"},{"key":"1563_CR60","doi-asserted-by":"publisher","unstructured":"Turner, M., Chmiela, A., Koch, T., Winkler, M.: PySCIPOpt-ML: Embedding Trained Machine Learning Models into Mixed-Integer Programs. In: Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Ed. by Tack, G. Cham: Springer Nature Switzerland, 218\u2013234 (2025). https:\/\/doi.org\/10.1007\/978-3-031-95976-9_14","DOI":"10.1007\/978-3-031-95976-9_14"},{"issue":"3","key":"1563_CR61","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF00938217","volume":"52","author":"H Tuy","year":"1987","unstructured":"Tuy, H.: Convex programs with an additional reverse convex constraint. In: J. Optim. Theory Appl. 52(3), 463\u2013486 (1987). https:\/\/doi.org\/10.1007\/BF00938217","journal-title":"In: J. Optim. Theory Appl."},{"key":"1563_CR62","unstructured":"Vavasis, S.A.: Nonlinear optimization. Vol.\u00a08. International Series of Monographs on Computer Science. Complexity issues. The Clarendon Press, Oxford University Press, New York, xiv+165 (1991)"},{"key":"1563_CR63","unstructured":"Virmaux, A., Scaman, K.: Lipschitz regularity of deep neural networks: analysis and efficient estimation. In: Advances in Neural Information Processing Systems. Ed. by Bengio, S., Wallach, H., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R. 31. Curran Associates, Inc., (2018)"},{"key":"1563_CR64","doi-asserted-by":"publisher","unstructured":"Westerlund, T., Pettersson, F.: An extended cutting plane method for solving convex MINLP problems. In: Computers & Chemical Engineering 19. European Symposium on Computer Aided Process Engineering 3\u20135, 131\u2013136 (1995). https:\/\/doi.org\/10.1016\/0098-1354(95)87027-X","DOI":"10.1016\/0098-1354(95)87027-X"},{"key":"1563_CR65","doi-asserted-by":"publisher","unstructured":"Westerlund, T., Skrifvars, H., Harjunkoski, I., P\u00f6rn, R.: An extended cutting plane method for a class of non-convex MINLP problems. In: Computers & Chemical Engineering 22(3), 357\u2013365 (1998). https:\/\/doi.org\/10.1016\/S0098-1354(97)00000-8","DOI":"10.1016\/S0098-1354(97)00000-8"},{"key":"1563_CR66","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF00229304","volume":"8","author":"GR Wood","year":"1996","unstructured":"Wood, G.R., Zhang, B.: Estimation of the Lipschitz constant of a function. J. Glob. Optim. 8, 91\u2013103 (1996). https:\/\/doi.org\/10.1007\/BF00229304","journal-title":"J. Glob. Optim."},{"key":"1563_CR67","doi-asserted-by":"publisher","unstructured":"Yamada, S., Tanino, T., Inuiguchi, M.: Inner approximation method for a reverse convex programming problem. In: J. Optim. Theory Appl. 107(2), 355\u2013389 (2000). https:\/\/doi.org\/10.1023\/A:1026456730792","DOI":"10.1023\/A:1026456730792"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-025-01563-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-025-01563-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-025-01563-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T06:27:23Z","timestamp":1770618443000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-025-01563-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":67,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["1563"],"URL":"https:\/\/doi.org\/10.1007\/s10898-025-01563-9","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"20 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest\/Competing interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}