{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:49:32Z","timestamp":1758268172118},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T00:00:00Z","timestamp":1586131200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T00:00:00Z","timestamp":1586131200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Karlsruher Institut f\u00fcr Technologie (KIT)"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2021,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We address the problem of determining convergent upper bounds in continuous non-convex global minimization of box-constrained problems with equality constraints. These upper bounds are important for the termination of spatial branch-and-bound algorithms. Our method is based on the theorem of Miranda which helps to ensure the existence of feasible points in certain boxes. Then, the computation of upper bounds at the objective function over those boxes yields an upper bound for the globally minimal value. A proof of convergence is given under mild assumptions. An extension of our approach to problems including inequality constraints is possible.\n<\/jats:p>","DOI":"10.1007\/s10107-020-01493-2","type":"journal-article","created":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T17:03:18Z","timestamp":1586192598000},"page":"617-651","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Convergent upper bounds in global minimization with nonlinear equality constraints"],"prefix":"10.1007","volume":"187","author":[{"given":"Christian","family":"F\u00fcllner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Kirst","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Stein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,6]]},"reference":[{"issue":"1","key":"1493_CR1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF00121749","volume":"9","author":"CS Adjiman","year":"1996","unstructured":"Adjiman, C.S., Floudas, C.A.: Rigorous convex underestimators for general twice-differentiable problems. J. Glob. Optim. 9(1), 23\u201340 (1996)","journal-title":"J. Glob. Optim."},{"key":"1493_CR2","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/0098-1354(96)00080-4","volume":"20","author":"CS Adjiman","year":"1996","unstructured":"Adjiman, C.S., Androulakis, I.P., Maranas, C.D., Floudas, C.A.: A global optimization method, $$\\alpha \\text{ bb }$$, for process design. Comput. Chem. Eng. 20, 419\u2013424 (1996)","journal-title":"Comput. Chem. Eng."},{"key":"1493_CR3","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0098-1354(97)00089-6","volume":"21","author":"CS Adjiman","year":"1997","unstructured":"Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: Global optimization of MINLP problems in process synthesis and design. Comput. Chem. Eng. 21, 445\u2013450 (1997)","journal-title":"Comput. Chem. Eng."},{"issue":"9","key":"1493_CR4","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1016\/S0098-1354(98)00218-X","volume":"22","author":"CS Adjiman","year":"1998","unstructured":"Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: A global optimization method, $$\\alpha \\text{ bb }$$, for general twice-differentiable constrained NLPS: II. Implementation and computational results. Comput. Chem. Eng. 22(9), 1159\u20131179 (1998)","journal-title":"Comput. Chem. Eng."},{"issue":"9","key":"1493_CR5","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1016\/S0098-1354(98)00027-1","volume":"22","author":"CS Adjiman","year":"1998","unstructured":"Adjiman, C.S., Dallwig, S., Floudas, C.A., Neumaier, A.: A global optimization method, $$\\alpha \\text{ bb }$$, for general twice-differentiable constrained NLPS: I. Theoretical advances. Comput. Chem. Eng. 22(9), 1137\u20131158 (1998)","journal-title":"Comput. Chem. Eng."},{"issue":"4","key":"1493_CR6","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF01099647","volume":"7","author":"IP Androulakis","year":"1995","unstructured":"Androulakis, I.P., Maranas, C.D., Floudas, C.A.: $$\\alpha \\text{ bb }$$: a global optimization method for general constrained nonconvex problems. J. Glob. Optim. 7(4), 337\u2013363 (1995)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1493_CR7","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/BF01934696","volume":"28","author":"E Baumann","year":"1988","unstructured":"Baumann, E.: Optimal centered forms. BIT Numer. Math. 28(1), 80\u201387 (1988)","journal-title":"BIT Numer. Math."},{"key":"1493_CR8","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24, 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"1493_CR9","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10898-014-0158-2","volume":"61","author":"F Domes","year":"2015","unstructured":"Domes, F., Neumaier, A.: Rigorous verification of feasibility. J. Glob. Optim. 61(2), 255\u2013278 (2015)","journal-title":"J. Glob. Optim."},{"key":"1493_CR10","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s101070100236","volume":"91","author":"M D\u00fcr","year":"2001","unstructured":"D\u00fcr, M.: Dual bounding procedures lead to convergent branch-and-bound algorithms. Math. Program. 91, 117\u2013125 (2001)","journal-title":"Math. Program."},{"key":"1493_CR11","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1023\/A:1013890609372","volume":"22","author":"M D\u00fcr","year":"2002","unstructured":"D\u00fcr, M.: A class of problems where dual bounds beat underestimation bounds. J. Glob. Optim. 22, 49\u201357 (2002)","journal-title":"J. Glob. Optim."},{"key":"1493_CR12","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/mnsc.15.9.550","volume":"15","author":"JE Falk","year":"1969","unstructured":"Falk, J.E., Soland, R.M.: An algorithm for separable nonconvex programming problems. Manag. Sci. 15, 550\u2013569 (1969)","journal-title":"Manag. Sci."},{"key":"1493_CR13","series-title":"Theory, Methods, and Applications","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4949-6","volume-title":"Deterministic Global Optimization","author":"CA Floudas","year":"2000","unstructured":"Floudas, C.A.: Deterministic Global Optimization. Theory, Methods, and Applications. Kluwer, Dordrecht (2000)"},{"key":"1493_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10898-008-9332-8","volume":"45","author":"CA Floudas","year":"2009","unstructured":"Floudas, C.A., Gounaris, C.E.: A review of recent advances in global optimization. J. Glob. Optim. 45, 3\u201338 (2009)","journal-title":"J. Glob. Optim."},{"key":"1493_CR15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/978-1-4614-1927-3_10","volume-title":"Mixed Integer Nonlinear Programming","author":"B Geissler","year":"2012","unstructured":"Geissler, B., Martin, A., Morsi, A., Schewe, L.: Using piecewise linear functions for solving MINLPS. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, pp. 287\u2013314. Springer, Berlin (2012)"},{"key":"1493_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization. Deterministic Approaches","author":"R Horst","year":"1996","unstructured":"Horst, R., Tuy, H.: Global Optimization. Deterministic Approaches. Springer, Berlin (1996)"},{"key":"1493_CR17","doi-asserted-by":"crossref","unstructured":"Jongen, H.Th., Jonker, P., Twilt, F.: Nonlinear Optimization in Finite Dimensions. Kluwer, Dordrecht (2000)","DOI":"10.1007\/978-1-4615-0017-9"},{"key":"1493_CR18","doi-asserted-by":"crossref","unstructured":"Jongen, H.Th., Stein, O.: On the complexity of equalizing inequalities. J. Glob. Optim. 27, 367\u2013374 (2003)","DOI":"10.1023\/A:1026051901133"},{"key":"1493_CR19","first-page":"89","volume":"83","author":"RB Kearfott","year":"1998","unstructured":"Kearfott, R.B.: On proving existence of feasible points in equality constrained optimization problems. Math. Program. 83, 89\u2013100 (1998)","journal-title":"Math. Program."},{"issue":"2\u20133","key":"1493_CR20","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10898-014-0173-3","volume":"59","author":"RB Kearfott","year":"2014","unstructured":"Kearfott, R.B.: On rigorous upper bounds to a global optimum. J. Glob. Optim. 59(2\u20133), 459\u2013476 (2014)","journal-title":"J. Glob. Optim."},{"key":"1493_CR21","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/s11750-015-0387-7","volume":"23","author":"P Kirst","year":"2015","unstructured":"Kirst, P., Stein, O., Steuermann, P.: Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints. TOP 23, 591\u2013616 (2015)","journal-title":"TOP"},{"key":"1493_CR22","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02241818","volume":"28","author":"R Krawczyk","year":"1982","unstructured":"Krawczyk, R., Nickel, K.: Die zentrische form in der Intervallarithmetik, ihre quadratische Konvergenz und Inklusionsisotonie. Computing 28, 117\u2013137 (1982)","journal-title":"Computing"},{"issue":"6","key":"1493_CR23","first-page":"545","volume":"104","author":"W Kulpa","year":"1997","unstructured":"Kulpa, W.: The Poincar\u00e9\u2013Miranda theorem. Am. Math. Mon. 104(6), 545\u2013550 (1997)","journal-title":"Am. Math. Mon."},{"key":"1493_CR24","series-title":"Nonconvex Optimization and its Applications","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-30528-9","volume-title":"Global Optimization: From Theory to Implementation","author":"L Liberti","year":"2006","unstructured":"Liberti, L., Maculan, N.: Global Optimization: From Theory to Implementation. Nonconvex Optimization and its Applications. Kluwer Academic Publishers, Dordrecht (2006)"},{"key":"1493_CR25","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1080\/10556780902753221","volume":"24","author":"Y Lin","year":"2009","unstructured":"Lin, Y., Schrage, L.: The global solver in the LINDO API. Optim. Methods Softw. 24, 657\u2013668 (2009)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"1493_CR26","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S0098-1354(96)00282-7","volume":"21","author":"CD Maranas","year":"1997","unstructured":"Maranas, C.D., Floudas, C.A.: Global optimization in generalized geometric programming. Comput. Chem. Eng. 21(4), 351\u2013369 (1997)","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"1493_CR27","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: part I\u2014convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"1493_CR28","first-page":"527","volume":"3","author":"C Miranda","year":"1940","unstructured":"Miranda, C.: Un\u2019 osservazione su una teorema di Brouwer. Boll. Unione Mat. Ital. 3, 527 (1940)","journal-title":"Boll. Unione Mat. Ital."},{"key":"1493_CR29","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/s10957-009-9626-0","volume":"145","author":"R Misener","year":"2010","unstructured":"Misener, R., Floudas, C.A.: Piecewise-linear approximations of multidimensional functions. J. Optim. Theory Appl. 145, 120\u2013147 (2010)","journal-title":"J. Optim. Theory Appl."},{"key":"1493_CR30","doi-asserted-by":"crossref","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, 503\u2013526 (2014)","journal-title":"J. Glob. Optim."},{"key":"1493_CR31","doi-asserted-by":"crossref","first-page":"1291","DOI":"10.1080\/02331934.2010.527970","volume":"60","author":"A Mitsos","year":"2011","unstructured":"Mitsos, A.: Global optimization of semi-infinite programs via restriction of the right-hand side. Optimization 60, 1291\u20131308 (2011)","journal-title":"Optimization"},{"key":"1493_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10898-014-0146-6","volume":"61","author":"A Mitsos","year":"2015","unstructured":"Mitsos, A., Tsoukalas, A.: Global optimization of generalized semi-infinite programs via restriction of the right hand side. J. Glob. Optim. 61, 1\u201317 (2015)","journal-title":"J. Glob. Optim."},{"key":"1493_CR33","volume-title":"Interval Methods for Systems of Equations","author":"A Neumaier","year":"1990","unstructured":"Neumaier, A.: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge (1990)"},{"issue":"1","key":"1493_CR34","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1080\/02331938808843322","volume":"19","author":"J Pint\u00e9r","year":"1988","unstructured":"Pint\u00e9r, J.: Branch-and-Bound algorithms for solving global optimizatiom problems with Lipschitzian structure. Optimization 19(1), 101\u2013110 (1988)","journal-title":"Optimization"},{"issue":"1","key":"1493_CR35","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/s10957-014-0688-2","volume":"167","author":"S Rebennack","year":"2015","unstructured":"Rebennack, S., Kallrath, J.: Continuous piecewise linear delta-approximations for bivariate and multivariate functions. J. Optim. Theory Appl. 167(1), 102\u2013117 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"1493_CR36","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-94-017-1247-7_7","volume-title":"Developments in Reliable Computing","author":"SM Rump","year":"1999","unstructured":"Rump, S.M.: INTLAB\u2014INTerval LABoratory. In: Csendes, T. (ed.) Developments in Reliable Computing, pp. 77\u2013104. Kluwer Academic Publishers, Dordrecht (1999)"},{"issue":"5","key":"1493_CR37","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0098-1354(94)00097-2","volume":"19","author":"HS Ryoo","year":"1995","unstructured":"Ryoo, H.S., Sahinidis, N.V.: Global optimization of nonconvex NLPs and MINLPs with applications in process design. Comput. Chem. Eng. 19(5), 551\u2013566 (1995)","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"1493_CR38","doi-asserted-by":"crossref","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. Glob. Optim. 8(2), 107\u2013138 (1996)","journal-title":"J. Glob. Optim."},{"key":"1493_CR39","doi-asserted-by":"crossref","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. Glob. Optim. 8, 201\u2013205 (1996)","journal-title":"J. Glob. Optim."},{"key":"1493_CR40","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/978-3-540-39901-8_16","volume-title":"Global Optimziation and Constraint Satisfaction","author":"O Shcherbina","year":"2003","unstructured":"Shcherbina, O., Neumaier, A., Sam-Haroud, D., Vu, X.-H., Nguyen, T.-V.: Benchmarking global optimization and constraint satisfaction codes. In: Blieck, Ch., Jermann, Ch., Neumaier, A. (eds.) Global Optimziation and Constraint Satisfaction, pp. 211\u2013222. Springer, Berlin (2003)"},{"key":"1493_CR41","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1016\/S0098-1354(97)00146-4","volume":"21","author":"EMB Smith","year":"1997","unstructured":"Smith, E.M.B., Pantelides, C.C.: Global optimisation of nonconvex MINLPs. Comput. Chem. Eng. 21, 791\u2013796 (1997)","journal-title":"Comput. Chem. Eng."},{"key":"1493_CR42","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0098-1354(98)00286-5","volume":"23","author":"EMB Smith","year":"1999","unstructured":"Smith, E.M.B., Pantelides, C.C.: A symbolic reformulation\/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Comput. Chem. Eng. 23, 457\u2013478 (1999)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"1493_CR43","doi-asserted-by":"crossref","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."},{"key":"1493_CR44","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. B 103, 225\u2013249 (2005)","journal-title":"Math. Program. B"},{"issue":"3","key":"1493_CR45","first-page":"701","volume":"107","author":"M Vrahatis","year":"1989","unstructured":"Vrahatis, M.: A short proof and a generalization of Miranda\u2019s existence theorem. Proc. Am. Math. Soc. 107(3), 701\u2013703 (1989)","journal-title":"Proc. Am. Math. Soc."},{"key":"1493_CR46","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1023\/A:1008312714792","volume":"14","author":"JM Zamora","year":"1999","unstructured":"Zamora, J.M., Grossmann, I.E.: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms. J. Glob. Optim. 14, 217\u2013249 (1999)","journal-title":"J. Glob. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01493-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-020-01493-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01493-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,20]],"date-time":"2021-04-20T18:53:46Z","timestamp":1618944826000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-020-01493-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,6]]},"references-count":46,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["1493"],"URL":"https:\/\/doi.org\/10.1007\/s10107-020-01493-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,6]]},"assertion":[{"value":"6 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}