{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T18:35:04Z","timestamp":1786214104973,"version":"3.56.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10898-022-01178-4","type":"journal-article","created":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T02:03:18Z","timestamp":1656640998000},"page":"807-842","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Alternative regularizations for Outer-Approximation algorithms for convex MINLP"],"prefix":"10.1007","volume":"84","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8308-5016","authenticated-orcid":false,"given":"David E.","family":"Bernal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6001-1738","authenticated-orcid":false,"given":"Zedong","family":"Peng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0299-5745","authenticated-orcid":false,"given":"Jan","family":"Kronqvist","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7210-084X","authenticated-orcid":false,"given":"Ignacio E.","family":"Grossmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,1]]},"reference":[{"issue":"4","key":"1178_CR1","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1287\/ijoc.1090.0373","volume":"22","author":"K Abhishek","year":"2010","unstructured":"Abhishek, K., Leyffer, S., Linderoth, J.: FilMINT: An outer approximation-based solver for convex mixed-integer nonlinear programs. INFORMS J. Comput. 22(4), 555\u2013567 (2010)","journal-title":"INFORMS J. Comput."},{"key":"1178_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08114-4","volume-title":"Introduction to Nonsmooth Optimization: Theory, Practice and Software","author":"A Bagirov","year":"2014","unstructured":"Bagirov, A., Karmitsa, N., M\u00e4kel\u00e4, M.M.: Introduction to Nonsmooth Optimization: Theory, Practice and Software. Springer, Berlin (2014)"},{"key":"1178_CR3","doi-asserted-by":"crossref","unstructured":"Bernal, D.E., Chen, Q., Gong, F., Grossmann, I.E.: Mixed-integer nonlinear decomposition toolbox for Pyomo (MindtPy). In: Computer Aided Chemical Engineering, vol\u00a044, pp. 895\u2013900. Elsevier (2018)","DOI":"10.1016\/B978-0-444-64241-7.50144-0"},{"issue":"1","key":"1178_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1080\/10556788.2019.1641498","volume":"35","author":"DE Bernal","year":"2020","unstructured":"Bernal, D.E., Vigerske, S., Trespalacios, F., Grossmann, I.E.: Improving the performance of DICOPT in convex MINLP problems using a feasibility pump. Optim. Methods Softw. 35(1), 171\u2013190 (2020)","journal-title":"Optim. Methods Softw."},{"key":"1178_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492900002518","volume":"4","author":"PT Boggs","year":"1995","unstructured":"Boggs, P.T., Tolle, J.W.: Sequential quadratic programming. Acta Numer. 4, 1\u201351 (1995)","journal-title":"Acta Numer."},{"issue":"2","key":"1178_CR6","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"Bonami, P., Biegler, L.T., Conn, A.R., Cornu\u00e9jols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., W\u00e4chter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discret. Optim. 5(2), 186\u2013204 (2008). https:\/\/doi.org\/10.1016\/j.disopt.2006.10.011","journal-title":"Discret. Optim."},{"issue":"2","key":"1178_CR7","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10107-008-0212-2","volume":"119","author":"P Bonami","year":"2009","unstructured":"Bonami, P., Cornu\u00e9jols, G., Lodi, A., Margot, F.: A feasibility pump for mixed integer nonlinear programs. Math. Program. 119(2), 331\u2013352 (2009)","journal-title":"Math. Program."},{"issue":"3","key":"1178_CR8","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. Eur. J. Oper. Res. 252(3), 701\u2013727 (2016)","journal-title":"CDFO. Eur. J. Oper. Res."},{"issue":"1","key":"1178_CR9","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-a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15(1), 114\u2013119 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"2\u20133","key":"1178_CR10","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10898-013-0131-5","volume":"59","author":"MR Bussieck","year":"2014","unstructured":"Bussieck, M.R., Dirkse, S.P., Vigerske, S.: PAVER 2.0: an open source environment for automated performance analysis of benchmarking data. J. Glob. Optim. 59(2\u20133), 259\u2013275 (2014)","journal-title":"J. Glob. Optim."},{"key":"1178_CR11","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s12532-020-00178-3","volume":"12","author":"C Coey","year":"2020","unstructured":"Coey, C., Lubin, M., Vielma, J.P.: Outer approximation with conic certificates for mixed-integer convex problems. Math. Program. Comput. 12, 249\u2013293 (2020)","journal-title":"Math. Program. Comput."},{"key":"1178_CR12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857","volume-title":"Trust Region Methods","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I., Toint, P.L.: Trust Region Methods. SIAM, Philadelphia (2000)"},{"issue":"3","key":"1178_CR13","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1093\/comjnl\/8.3.250","volume":"8","author":"RJ Dakin","year":"1965","unstructured":"Dakin, R.J.: A tree-search algorithm for mixed integer programming problems. Comput. J. 8(3), 250\u2013255 (1965)","journal-title":"Comput. J."},{"issue":"6","key":"1178_CR14","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1080\/02331934.2018.1434173","volume":"67","author":"A Delfino","year":"2018","unstructured":"Delfino, A., de Oliveira, W.: Outer-approximation algorithms for nonsmooth convex MINLP problems. Optimization 67(6), 797\u2013819 (2018)","journal-title":"Optimization"},{"issue":"3","key":"1178_CR15","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(3), 307\u2013339 (1986)","journal-title":"Math. Program."},{"key":"1178_CR16","volume-title":"Practical Methods of Optimization","author":"R Fletcher","year":"2013","unstructured":"Fletcher, R.: Practical Methods of Optimization. Wiley, Hoboken (2013)"},{"issue":"1","key":"1178_CR17","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF01581153","volume":"66","author":"R Fletcher","year":"1994","unstructured":"Fletcher, R., Leyffer, S.: Solving mixed integer nonlinear programs by outer approximation. Math. Program. 66(1), 327\u2013349 (1994)","journal-title":"Math. Program."},{"key":"1178_CR18","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780195100563.001.0001","volume-title":"Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications","author":"CA Floudas","year":"1995","unstructured":"Floudas, C.A.: Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications. Oxford University Press, Oxford (1995)"},{"issue":"4","key":"1178_CR19","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"AM Geoffrion","year":"1972","unstructured":"Geoffrion, A.M.: Generalized Benders decomposition. J. Optim. Theory Appl. 10(4), 237\u2013260 (1972)","journal-title":"J. Optim. Theory Appl."},{"issue":"12","key":"1178_CR20","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1287\/mnsc.31.12.1533","volume":"31","author":"OK Gupta","year":"1985","unstructured":"Gupta, O.K., Ravindran, A.: Branch and bound experiments in convex nonlinear integer programming. Manage. Sci. 31(12), 1533\u20131546 (1985)","journal-title":"Manage. Sci."},{"issue":"1","key":"1178_CR21","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01580395","volume":"11","author":"SP Han","year":"1976","unstructured":"Han, S.P.: Superlinearly convergent variable metric algorithms for general nonlinear programming problems. Math. Program. 11(1), 263\u2013282 (1976)","journal-title":"Math. Program."},{"key":"1178_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-58821-6","volume-title":"Pyomo-optimization Modeling in Python","author":"WE Hart","year":"2017","unstructured":"Hart, W.E., Laird, C.D., Watson, J.P., Woodruff, D.L., Hackebeil, G.A., Nicholson, B.L., Siirola, J.D., et al.: Pyomo-optimization Modeling in Python, vol. 67. Springer, Berlin (2017)"},{"issue":"2","key":"1178_CR23","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF02032162","volume":"58","author":"D den Hertog","year":"1995","unstructured":"den Hertog, D., Kaliski, J., Roos, C., Terlaky, T.: A logarithmic barrier cutting plane method for convex programming. Ann. Oper. Res. 58(2), 67\u201398 (1995)","journal-title":"Ann. Oper. Res."},{"key":"1178_CR24","unstructured":"HSL: A collection of Fortran codes for large scale scientific computation (2007). http:\/\/www.hsl.rl.ac.uk"},{"key":"1178_CR25","unstructured":"Hunting, M.: The AIMMS outer approximation algorithm for MINLP. Technical report, AIMMS B.V (2011)"},{"key":"1178_CR26","unstructured":"IBM Corp, IBM: V20.1: User\u2019s Manual for CPLEX. International Business Machines Corporation (2020) https:\/\/www.ibm.com\/docs\/en\/icos\/20.1.0?topic=cplex"},{"issue":"4","key":"1178_CR27","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"JE Kelley Jr","year":"1960","unstructured":"Kelley, J.E., Jr.: The cutting-plane method for solving convex programs. J. Soc. Ind. Appl. Math. 8(4), 703\u2013712 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"3","key":"1178_CR28","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s12532-018-0138-5","volume":"10","author":"A Khajavirad","year":"2018","unstructured":"Khajavirad, A., Sahinidis, N.V.: A hybrid LP\/NLP paradigm for global optimization relaxations. Math. Program. Comput. 10(3), 383\u2013421 (2018)","journal-title":"Math. Program. Comput."},{"issue":"1\u20133","key":"1178_CR29","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF01585554","volume":"69","author":"KC Kiwiel","year":"1995","unstructured":"Kiwiel, K.C.: Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities. Math. Program. 69(1\u20133), 89\u2013109 (1995)","journal-title":"Math. Program."},{"key":"1178_CR30","volume-title":"Introductory Functional Analysis with Applications","author":"E Kreyszig","year":"1978","unstructured":"Kreyszig, E.: Introductory Functional Analysis with Applications, vol. 1. Wiley, New York (1978)"},{"issue":"2","key":"1178_CR31","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10898-015-0322-3","volume":"64","author":"J Kronqvist","year":"2016","unstructured":"Kronqvist, J., Lundell, A., Westerlund, T.: The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming. J. Glob. Optim. 64(2), 249\u2013272 (2016)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"1178_CR32","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s10898-018-0616-3","volume":"71","author":"J Kronqvist","year":"2018","unstructured":"Kronqvist, J., Lundell, A., Westerlund, T.: Reformulations for utilizing separability when solving convex MINLP problems. J. Glob. Optim. 71(3), 571\u2013592 (2018)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"1178_CR33","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s11081-018-9411-8","volume":"20","author":"J Kronqvist","year":"2019","unstructured":"Kronqvist, J., Bernal, D.E., Lundell, A., Grossmann, I.E.: A review and comparison of solvers for convex MINLP. Optim. Eng. 20(2), 397\u2013455 (2019)","journal-title":"Optim. Eng."},{"key":"1178_CR34","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.compchemeng.2018.06.019","volume":"122","author":"J Kronqvist","year":"2019","unstructured":"Kronqvist, J., Bernal, D.E., Lundell, A., Westerlund, T.: A center-cut algorithm for quickly obtaining feasible solutions and solving convex MINLP problems. Comput. Chem. Eng. 122, 105\u2013113 (2019)","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"1178_CR35","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10107-018-1356-3","volume":"180","author":"J Kronqvist","year":"2020","unstructured":"Kronqvist, J., Bernal, D.E., Grossmann, I.E.: Using regularization and second order information in outer approximation for convex MINLP. Math. Program. 180(1), 285\u2013310 (2020)","journal-title":"Math. Program."},{"key":"1178_CR36","volume-title":"Mixed Integer Nonlinear Programming","author":"J Lee","year":"2011","unstructured":"Lee, J., Leyffer, S.: Mixed Integer Nonlinear Programming, vol. 154. Springer, Berlin (2011)"},{"issue":"1\u20133","key":"1178_CR37","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01585555","volume":"69","author":"C Lemar\u00e9chal","year":"1995","unstructured":"Lemar\u00e9chal, C., Nemirovskii, A., Nesterov, Y.: New variants of bundle methods. Math. Program. 69(1\u20133), 111\u2013147 (1995)","journal-title":"Math. Program."},{"issue":"1","key":"1178_CR38","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/s10878-014-9715-3","volume":"28","author":"L Liberti","year":"2014","unstructured":"Liberti, L., Marinelli, F.: Mathematical programming: turing completeness and applications to software analysis. J. Comb. Optim. 28(1), 82\u2013104 (2014)","journal-title":"J. Comb. Optim."},{"key":"1178_CR39","doi-asserted-by":"crossref","unstructured":"Liberti, L., Cafieri, S., Tarissan, F.: Reformulations in mathematical programming: a computational approach. In: Foundations of Computational Intelligence, vol. 3, pp. 153\u2013234. Springer (2009)","DOI":"10.1007\/978-3-642-01085-9_7"},{"key":"1178_CR40","doi-asserted-by":"crossref","unstructured":"Lundell, A., Kronqvist, J.: Integration of polyhedral outer approximation algorithms with mip solvers through callbacks and lazy constraints. In: AIP Conference Proceedings, AIP Publishing LLC, vol. 2070. p. 020012 (2019)","DOI":"10.1063\/1.5089979"},{"key":"1178_CR41","doi-asserted-by":"crossref","unstructured":"Lundell, A., Kronqvist, J., Westerlund, T.: The supporting hyperplane optimization toolkit for convex MINLP. J. Glob. Optim. 1\u201341 (2022)","DOI":"10.1007\/s10898-022-01128-0"},{"key":"1178_CR42","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, vol. 87. Springer, Berlin (2004)"},{"issue":"3","key":"1178_CR43","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s11750-016-0413-4","volume":"24","author":"W de Oliveira","year":"2016","unstructured":"de Oliveira, W.: Regularized optimization methods for convex MINLP problems. TOP 24(3), 665\u2013692 (2016)","journal-title":"TOP"},{"issue":"10\u201311","key":"1178_CR44","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/0098-1354(92)80028-8","volume":"16","author":"I Quesada","year":"1992","unstructured":"Quesada, I., Grossmann, I.E.: An LP\/NLP based branch and bound algorithm for convex MINLP optimization problems. Comput. Chem. Eng. 16(10\u201311), 937\u2013947 (1992)","journal-title":"Comput. Chem. Eng."},{"key":"1178_CR45","unstructured":"Sawaya, N., Grossmann, I.E.: Reformulations, relaxations and cutting planes for linear generalized disjunctive programming (2008)"},{"key":"1178_CR46","unstructured":"Slater, M.: Lagrange multipliers revisited. Cowles Foundation for Research in Economics, Yale University, Technical reports (1950)"},{"key":"1178_CR47","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.compchemeng.2017.10.011","volume":"109","author":"L Su","year":"2018","unstructured":"Su, L., Tang, L., Bernal, D.E., Grossmann, I.E.: Improved quadratic cuts for convex mixed-integer nonlinear programs. Comput. Chem. Eng. 109, 77\u201395 (2018)","journal-title":"Comput. Chem. Eng."},{"key":"1178_CR48","volume-title":"Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications","author":"M Tawarmalani","year":"2013","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications, vol. 65. Springer, Berlin (2013)"},{"issue":"7","key":"1178_CR49","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1002\/cite.201400037","volume":"86","author":"F Trespalacios","year":"2014","unstructured":"Trespalacios, F., Grossmann, I.E.: Review of mixed-integer nonlinear and generalized disjunctive programming methods. Chem. Ing. Tec. 86(7), 991\u20131012 (2014)","journal-title":"Chem. Ing. Tec."},{"issue":"1","key":"1178_CR50","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"1178_CR51","doi-asserted-by":"publisher","first-page":"S131","DOI":"10.1016\/0098-1354(95)00164-W","volume":"19","author":"T Westerlund","year":"1995","unstructured":"Westerlund, T., Petterson, F.: An extended cutting plane method for solving convex MINLP problems. Comput. Chem. Eng. 19, S131\u2013S136 (1995)","journal-title":"Comput. Chem. Eng."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01178-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01178-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01178-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T02:09:41Z","timestamp":1668478181000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01178-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,1]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["1178"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01178-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,1]]},"assertion":[{"value":"15 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}