{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T12:58:17Z","timestamp":1770814697875,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T00:00:00Z","timestamp":1582156800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T00:00:00Z","timestamp":1582156800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006360","name":"Bundesministerium f\u00fcr Wirtschaft und Energie","doi-asserted-by":"publisher","award":["03ET4053B"],"award-info":[{"award-number":["03ET4053B"]}],"id":[{"id":"10.13039\/501100006360","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2020,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents a new two-phase method for solving convex mixed-integer nonlinear programming (MINLP) problems, called Decomposition-based Outer Approximation Algorithm (DECOA). In the first phase, a sequence of linear integer relaxed sub-problems (LP phase) is solved in order to rapidly generate a good linear relaxation of the original MINLP problem. In the second phase, the algorithm solves a sequence of mixed integer linear programming sub-problems (MIP phase). In both phases the outer approximation is improved iteratively by adding new supporting hyperplanes by solving many easier sub-problems in parallel. DECOA is implemented as a part of Decogo (Decomposition-based Global Optimizer), a parallel decomposition-based MINLP solver implemented in Python and Pyomo. Preliminary numerical results based on 70 convex MINLP instances up to 2700 variables show that due to the generated cuts in the LP phase, on average only 2\u20133 MIP problems have to be solved in the MIP phase.\n<\/jats:p>","DOI":"10.1007\/s10898-020-00888-x","type":"journal-article","created":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T06:15:00Z","timestamp":1582179300000},"page":"75-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming"],"prefix":"10.1007","volume":"77","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0665-9629","authenticated-orcid":false,"given":"Pavlo","family":"Muts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivo","family":"Nowak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eligius M. T.","family":"Hendrix","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"issue":"4\u20135","key":"888_CR1","doi-asserted-by":"publisher","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(4\u20135), 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"key":"888_CR2","doi-asserted-by":"crossref","unstructured":"Bernal, D.E., Chen, Q., Gong, F., Grossmann, I.E.: Mixed-integer nonlinear decomposition toolbox for Pyomo (MindtPy). In: 13th International Symposium on Process Systems Engineering (PSE 2018). Elsevier, Amsterdam (2018)","DOI":"10.1016\/B978-0-444-64241-7.50144-0"},{"key":"888_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s12469-013-0066-8","volume":"5","author":"R Bornd\u00f6rfer","year":"2013","unstructured":"Bornd\u00f6rfer, R., L\u00f6bel, A., Reuther, M., Schlechte, T., Weider, S.: Rapid branching. Public Transp. 5, 3\u201323 (2013)","journal-title":"Public Transp."},{"issue":"2","key":"888_CR4","first-page":"97","volume":"17","author":"S Burer","year":"2012","unstructured":"Burer, S., Letchford, A.: Non-convex mixed-integer nonlinear programming: a survey. Surv. Oper. Res. Manag. Sci. 17(2), 97\u2013106 (2012)","journal-title":"Surv. Oper. Res. Manag. Sci."},{"issue":"1","key":"888_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1080\/10556788.2018.1556661","volume":"35","author":"R Burlacu","year":"2020","unstructured":"Burlacu, R., Gei\u00dfler, B., Schewe, L.: Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes. Optim. Methods. Softw. 35(1), 37\u201364 (2020)","journal-title":"Optim. Methods. Softw."},{"key":"888_CR6","unstructured":"Bussieck, M.R., Vigerske, S.: MINLP Solver Software. http:\/\/www.math.hu-berlin.de\/~stefan\/minlpsoft.pdf, (2014)"},{"issue":"3","key":"888_CR7","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":"2","key":"888_CR8","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10107-012-0608-x","volume":"136","author":"C D\u2019Ambrosio","year":"2012","unstructured":"D\u2019Ambrosio, C., Frangioni, A., Liberti, L., Lodi, A.: A storm of feasibility pumps for nonconvex MINLP. Math. Program. 136(2), 375\u2013402 (2012)","journal-title":"Math. Program."},{"key":"888_CR9","volume-title":"Wiley Encyclopedia of Operations Research and Management Science","author":"J Desrosiers","year":"2010","unstructured":"Desrosiers, J., L\u00fcbbecke, M.: Branch-price-and-cut algorithms. In: Cochran, J., Cox, L., Keskinocak, P., Kharoufeh, J., Smith, J. (eds.) Wiley Encyclopedia of Operations Research and Management Science. Wiley, London (2010)"},{"key":"888_CR10","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"M Duran","year":"1986","unstructured":"Duran, M., Grossmann, I.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36, 307\u2013339 (1986)","journal-title":"Math. Program."},{"issue":"3","key":"888_CR11","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/S1052623498332336","volume":"10","author":"S Feltenmark","year":"2000","unstructured":"Feltenmark, S., Kiwiel, K.C.: Dual applications of proximal bundle methods including Lagrangian relaxation of nonconvex problems. SIAM J. Optim. 10(3), 697\u2013721 (2000)","journal-title":"SIAM J. Optim."},{"issue":"3(A)","key":"888_CR12","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(3(A)), 327\u2013349 (1994)","journal-title":"Math. Program."},{"key":"888_CR13","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF01580620","volume":"60","author":"OE Flippo","year":"1993","unstructured":"Flippo, O.E., Rinnooy-Kan, A.H.G.: Decomposition in general mathematical programming. Math. Program. 60, 361\u2013382 (1993)","journal-title":"Math. Program."},{"key":"888_CR14","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion, A.M.: Lagrangian relaxation for integer programming. Math. Program. Stud. 2, 82\u2013114 (1974)","journal-title":"Math. Program. Stud."},{"issue":"4","key":"888_CR15","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."},{"key":"888_CR16","unstructured":"Gleixner, A., Eifler, L., Gally, T., Gamrath, G., Gemander, P., Gottwald, R.L., Hendel, G., Hojny, C., Koch, T., Miltenberger, M., M\u00fcller, B., Pfetsch, M.E., Puchert, C., Rehfeldt, D., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Viernickel, J.M., Vigerske, S., Weninger, D., Witt, J.T., Witzig, J.: The SCIP Optimization Suite 5.0. Technical report, http:\/\/www.optimization-online.org\/DB_HTML\/2017\/12\/6385.html (2017)"},{"key":"888_CR17","doi-asserted-by":"crossref","unstructured":"Hart, W.E., Laird, C.D., Watson, J.-P., Woodruff, D.L., Hackebeil, G.A., Nicholson, B.L., Siirola, J.D.: Pyomo-optimization Modeling in Python, second edition, vol.\u00a067. Springer, Berlin (2017)","DOI":"10.1007\/978-3-319-58821-6"},{"key":"888_CR18","unstructured":"Hunting, M.: The AIMMS outer approximation algorithm for MINLP. AIMMS B.V, Technical report (2011)"},{"issue":"2","key":"888_CR19","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s11081-018-9411-8","volume":"20","author":"J Kronqvist","year":"2018","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 (2018)","journal-title":"Optim. Eng."},{"issue":"2","key":"888_CR20","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."},{"key":"888_CR21","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/PL00011429","volume":"90","author":"C Lemar\u00e9chal","year":"2001","unstructured":"Lemar\u00e9chal, C., Renaud, A.: A geometric study of duality gaps, with applications. Math. Program. 90, 399\u2013427 (2001)","journal-title":"Math. Program."},{"key":"888_CR22","unstructured":"Leyffer, S., Sartenaer, A., Wanufelle, E.: Branch-and-Refine for Mixed Integer Nonconvex Global Optimization. Technical report, Preprint ANL\/MCS-P1547-0908,Mathematics and Computer Science Division, Argonne National Laboratory (2008)"},{"issue":"4\u20135","key":"888_CR23","doi-asserted-by":"publisher","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(4\u20135), 657\u2013668 (2009)","journal-title":"Optim. Methods Softw."},{"issue":"6","key":"888_CR24","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"ME L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke, M.E., Desrosiers, J.: Selected topics in column generation. Oper. Res. 53(6), 1007\u20131023 (2005)","journal-title":"Oper. Res."},{"issue":"1","key":"888_CR25","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10107-017-1191-y","volume":"172","author":"M Lubin","year":"2018","unstructured":"Lubin, M., Yamangil, E., Bent, R., Vielma, J.P.: Polyhedral approximation in mixed-integer convex optimization. Math. Program. 172(1), 139\u2013168 (2018)","journal-title":"Math. Program."},{"issue":"2\u20133","key":"888_CR26","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.: ANTIGONE: algorithms for coNTinuous\/integer global optimization of nonlinear equations. J. Glob. Optim. 59(2\u20133), 503\u2013526 (2014)","journal-title":"J. Glob. Optim."},{"key":"888_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/3-7643-7374-1","volume-title":"Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming","author":"I Nowak","year":"2005","unstructured":"Nowak, I.: Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming. Birkh\u00e4user, Basel (2005)"},{"key":"888_CR28","unstructured":"Nowak, I.: Parallel decomposition methods for nonconvex optimization-recent advances and new directions. In: Proceedings of MAGO (2014)"},{"issue":"2","key":"888_CR29","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s10898-018-0633-2","volume":"72","author":"I Nowak","year":"2018","unstructured":"Nowak, I., Breitfeld, N., Hendrix, E.M.T., Njacheun-Njanzoua, G.: Decomposition-based Inner- and outer-refinement algorithms for global optimization. J. Glob. Optim. 72(2), 305\u2013321 (2018)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"888_CR30","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10107-005-0606-3","volume":"106","author":"T Ralphs","year":"2006","unstructured":"Ralphs, T., Galati, M.: Decomposition and dynamic cut generation in integer linear programming. Math. Program. 106(2), 261\u2013285 (2006)","journal-title":"Math. Program."},{"issue":"2","key":"888_CR31","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.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2), 225\u2013249 (2005)","journal-title":"Math. Program."},{"key":"888_CR32","unstructured":"Vigerske, S.: Decomposition in Multistage Stochastic Programming and a Constraint Integer Programming Approach to Mixed-Integer Nonlinear Programming. Ph.D. thesis, Humboldt-Universit\u00e4t zu Berlin (2012)"},{"key":"888_CR33","unstructured":"Vigerske, S.: MINLPLib. http:\/\/minlplib.org\/index.html (2018)"},{"key":"888_CR34","unstructured":"W\u00e4chter, A.: An interior point algorithm for large-scale nonlinear optimization with applications in process engineering. Ph.D. thesis, Carnegie Mellon University, Pittsburgh, USA, http:\/\/researcher.watson.ibm.com\/researcher\/files\/us-andreasw\/thesis.pdf (2002)"},{"issue":"1","key":"888_CR35","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., Lorenz, B.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":"888_CR36","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0098-1354(95)87027-X","volume":"21","author":"T Westerlund","year":"1995","unstructured":"Westerlund, T., Petterson, F.: An extended cutting plane method for solving convex MINLP problems. Comput. Chem. Eng. 21, 131\u2013136 (1995)","journal-title":"Comput. Chem. Eng."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00888-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-020-00888-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00888-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T20:07:51Z","timestamp":1613765271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-020-00888-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,20]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["888"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00888-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,20]]},"assertion":[{"value":"15 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}