{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T08:54:49Z","timestamp":1772614489021,"version":"3.50.1"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,4,17]],"date-time":"2021-04-17T00:00:00Z","timestamp":1618617600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,4,17]],"date-time":"2021-04-17T00:00:00Z","timestamp":1618617600000},"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":["J Glob Optim"],"published-print":{"date-parts":[[2021,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents a novel partially distributed outer approximation algorithm, named PaDOA, for solving a class of structured mixed integer convex programming problems to global optimality. The proposed scheme uses an iterative outer approximation method for coupled mixed integer optimization problems with separable convex objective functions, affine coupling constraints, and compact domain. PaDOA proceeds by alternating between solving large-scale structured mixed-integer linear programming problems and partially decoupled mixed-integer nonlinear programming subproblems that comprise much fewer integer variables. We establish conditions under which PaDOA converges to global minimizers after a finite number of iterations and verify these properties with an application to thermostatically controlled loads and to mixed-integer regression.<\/jats:p>","DOI":"10.1007\/s10898-021-01015-0","type":"journal-article","created":{"date-parts":[[2021,4,17]],"date-time":"2021-04-17T03:26:01Z","timestamp":1618629961000},"page":"523-550","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Partially distributed outer approximation"],"prefix":"10.1007","volume":"80","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9436-0407","authenticated-orcid":false,"given":"Alexander","family":"Murray","sequence":"first","affiliation":[]},{"given":"Timm","family":"Faulwasser","sequence":"additional","affiliation":[]},{"given":"Veit","family":"Hagenmeyer","sequence":"additional","affiliation":[]},{"given":"Mario E.","family":"Villanueva","sequence":"additional","affiliation":[]},{"given":"Boris","family":"Houska","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,17]]},"reference":[{"issue":"3","key":"1015_CR1","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1109\/TPWRS.2003.814891","volume":"18","author":"N Alguacil","year":"2003","unstructured":"Alguacil, N., Motto, A.L., Conejo, A.J.: Transmission expansion planning: a mixed-integer lp approach. IEEE Trans. Power Syst. 18(3), 1070\u20131077 (2003)","journal-title":"IEEE Trans. Power Syst."},{"key":"1015_CR2","doi-asserted-by":"crossref","unstructured":"Andersson, J.A.E., Gillis, J., Horn, G., Rawlings, J.B., Diehl, M.: CasADi\u2014a software framework for nonlinear optimization and optimal control. Math. Program. Comput. (2018) (in press)","DOI":"10.1007\/s12532-018-0139-4"},{"key":"1015_CR3","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1137\/060654797","volume":"18","author":"R Andreani","year":"2007","unstructured":"Andreani, R., Birgin, E.G., Martinez, J.M., Schuverdt, M.L.: On augmented Lagrangian methods with general lower-level constraints. SIAM J. Optim. 18, 1286\u20131309 (2007)","journal-title":"SIAM J. Optim."},{"key":"1015_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012064155-0\/50012-4","volume-title":"Introduction to Optimum Design","author":"JS Arora","year":"2004","unstructured":"Arora, J.S.: Introduction to Optimum Design. Elsevier, Amsterdam (2004)"},{"issue":"1","key":"1015_CR5","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Mat. 4(1), 238\u2013252 (1962)","journal-title":"Numer. Mat."},{"key":"1015_CR6","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)","edition":"2"},{"issue":"2","key":"1015_CR7","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. Discrete Optim. 5(2), 186\u2013204 (2008)","journal-title":"Discrete Optim."},{"key":"1015_CR8","doi-asserted-by":"crossref","unstructured":"Bonami, P., Kilin\u00e7, M., Linderoth, J.: Algorithms and software for convex mixed integer nonlinear programs. In: Mixed Integer Nonlinear Programming, vol. 154, pp. 1\u201339. Springer, New York (2012)","DOI":"10.1007\/978-1-4614-1927-3_1"},{"key":"1015_CR9","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0305-0548(94)90024-8","volume":"21","author":"B Borchers","year":"1994","unstructured":"Borchers, B., Mitchell, J.E.: An improved branch and bound algorithm for mixed integer nonlinear programs. Comput. Oper. Res. 21, 359\u2013368 (1994)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"1015_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"key":"1015_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"3","key":"1015_CR12","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.1109\/TPWRS.2006.876672","volume":"21","author":"M Carrion","year":"2006","unstructured":"Carrion, M., Arroyo, J.M.: A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem. IEEE Trans. Power Syst. 21(3), 1371\u20131378 (2006)","journal-title":"IEEE Trans. Power Syst."},{"key":"1015_CR13","doi-asserted-by":"crossref","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Polyhedral approaches to mixed integer linear programming. In: 50 Years of Integer Programming 1958\u20132008, pp. 343\u2013385. Springer, New York (2009)","DOI":"10.1007\/978-3-540-68279-0_11"},{"issue":"1","key":"1015_CR14","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Oper. Res. 8(1), 101\u2013111 (1960)","journal-title":"Oper. Res."},{"key":"1015_CR15","unstructured":"Deutscher Wetterdienst. ftp:\/\/ftp-cdc.dwd.de\/pub\/CDC\/observations_germany\/climate\/10_minutes\/solar\/historical\/ (2017)"},{"issue":"3","key":"1015_CR16","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":"1015_CR17","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55, 293\u2013318 (1992)","journal-title":"Math. Program."},{"issue":"7","key":"1015_CR18","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1080\/02331934.2012.712118","volume":"63","author":"V Eronen","year":"2014","unstructured":"Eronen, V., M\u00e4kel\u00e4, M.M., Westerlund, T.: On the generalization of ECP and OA methods to nonsmooth convex MINLP problems. Optimization 63(7), 1057\u20131073 (2014)","journal-title":"Optimization"},{"issue":"3","key":"1015_CR19","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/opre.11.3.399","volume":"11","author":"H Everett","year":"1963","unstructured":"Everett, H.: Generalized Lagrange multiplier method for solving problems of optimum allocation of resources. Oper. Res. 11(3), 399\u2013417 (1963)","journal-title":"Oper. Res."},{"issue":"1\u20133","key":"1015_CR20","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\u20133), 327\u2013349 (1994)","journal-title":"Math. Program."},{"key":"1015_CR21","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximations. Comput. Math. Appl. 2, 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"key":"1015_CR22","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences), 1st edn. W. H. Freeman, New York (1979)","edition":"1"},{"key":"1015_CR23","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"A Geoffrion","year":"1972","unstructured":"Geoffrion, A.: Generalized benders decomposition. J. Optim. Theory Appl. 10, 237\u2013260 (1972)","journal-title":"J. Optim. Theory Appl."},{"key":"1015_CR24","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. Manag. Sci. 31, 1533\u20131546 (1985)","journal-title":"Manag. Sci."},{"issue":"1","key":"1015_CR25","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1287\/ijoc.1120.0545","volume":"26","author":"H Hijazi","year":"2014","unstructured":"Hijazi, H., Bonami, P., Ouorou, A.: An outer-inner approximation for separable mixed-integer nonlinear programs. INFORMS J. Comput. 26(1), 31\u201344 (2014)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"1015_CR26","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1137\/140975991","volume":"26","author":"B Houska","year":"2016","unstructured":"Houska, B., Frasch, J., Diehl, M.: An augmented Lagrangian based algorithm for distributed Non-Convex optimization. SIAM J. Optim. 26(2), 1101\u20131127 (2016)","journal-title":"SIAM J. Optim."},{"key":"1015_CR27","unstructured":"IBM: Using the CPLEX callable library, version 12 (2009)"},{"issue":"3","key":"1015_CR28","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s10107-004-0503-1","volume":"100","author":"P Kesavan","year":"2004","unstructured":"Kesavan, P., Allgor, R.J., Gatzke, E.P., Barton, P.I.: Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs. Math. Program. 100(3), 517\u2013535 (2004)","journal-title":"Math. Program."},{"issue":"4","key":"1015_CR29","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s12532-017-0118-1","volume":"9","author":"MR Kilin\u00e7","year":"2017","unstructured":"Kilin\u00e7, M.R., Linderoth, J., Luedtke, J.: Lift-and-project cuts for convex mixed integer nonlinear programs. Math. Program. Comput. 9(4), 499\u2013526 (2017)","journal-title":"Math. Program. Comput."},{"issue":"6","key":"1015_CR30","doi-asserted-by":"publisher","first-page":"4161","DOI":"10.1109\/TPWRS.2017.2666718","volume":"32","author":"B Kocuk","year":"2017","unstructured":"Kocuk, B., Dey, S.S., Sun, X.: New formulation and strong MISOCP relaxations for AC optimal transmission switching problem. IEEE Trans. Power Syst. 32(6), 4161\u20134170 (2017)","journal-title":"IEEE Trans. Power Syst."},{"issue":"7","key":"1015_CR31","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1002\/ente.201600655","volume":"5","author":"P Kohlhepp","year":"2017","unstructured":"Kohlhepp, P., Hagenmeyer, V.: Technical potential of buildings in Germany as flexible power-to-heat storage for smart-grid operation. Energy Technol. 5(7), 1084\u20131104 (2017)","journal-title":"Energy Technol."},{"issue":"1","key":"1015_CR32","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."},{"issue":"3","key":"1015_CR33","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. Global Optim. 71(3), 571\u2013592 (2018)","journal-title":"J. Global Optim."},{"issue":"3","key":"1015_CR34","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10514-015-9479-3","volume":"40","author":"S Kuindersma","year":"2016","unstructured":"Kuindersma, S., Deits, R., Fallon, M., Valenzuela, A., Dai, H., Permenter, F., Koolen, T., Marion, P., Tedrake, R.: Optimization-based locomotion planning, estimation, and control design for the atlas humanoid robot. Auton. Robot. 40(3), 429\u2013455 (2016)","journal-title":"Auton. Robot."},{"key":"1015_CR35","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1023\/A:1011241421041","volume":"18","author":"S Leyffer","year":"2001","unstructured":"Leyffer, S.: Integrating SQP and branch-and-bound for mixed integer nonlinear programming. Comput. Optim. Appl. 18, 295\u2013309 (2001)","journal-title":"Comput. Optim. Appl."},{"key":"1015_CR36","doi-asserted-by":"crossref","unstructured":"Lubin, M., Yamangil, E., Bent, R., Vielma, J.P.: Polyhedral approximation in mixed-integer convex optimization. Math. Program. (2017)","DOI":"10.1007\/s10107-017-1191-y"},{"key":"1015_CR37","unstructured":"Lundell, A., Kronqvist, J., Westerlund, T.: The supporting hyperplane optimizationtoolkit\u2014a polyhedral outer approximation based convex MINLP solver utilizing a single branchingtree approach. Optim. Online (Preprint) (2018)"},{"key":"1015_CR38","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with Constraints: An Introduction","author":"K Marriott","year":"1998","unstructured":"Marriott, K., Stuckey, P.J.: Programming with Constraints: An Introduction. MIT Press, Cambridge (1998)"},{"key":"1015_CR39","doi-asserted-by":"crossref","unstructured":"Murray, A., Faulwasser, T., Hagenmeyer, V.: Mixed-integer vs. real-valued formulations of distributed battery scheduling problems. In: 10th Symposium on Control of Power and Energy Systems (CPES 2018) (2018)","DOI":"10.1016\/j.ifacol.2018.11.727"},{"key":"1015_CR40","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"KG Murty","year":"1987","unstructured":"Murty, K.G., Kabadi, S.N.: Some NP-complete problems in quadratic and nonlinear programming. Math. Program. 39, 117\u2013129 (1987)","journal-title":"Math. Program."},{"key":"1015_CR41","first-page":"1","volume":"75","author":"P Muts","year":"2020","unstructured":"Muts, P., Nowak, I., Hendrix, E.M.T.: The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming. J. Global Optim. 75, 1\u201322 (2020)","journal-title":"J. Global Optim."},{"key":"1015_CR42","doi-asserted-by":"crossref","unstructured":"Muts, P., Nowak, I., Hendrix, E.M.T.: On decomposition and multiobjective-based column and disjunctive cut generation for MINLP. Optim. Eng. 1\u201330 (2020)","DOI":"10.1007\/s11081-020-09576-x"},{"issue":"11","key":"1015_CR43","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1109\/TAC.2008.2007159","volume":"53","author":"I Necoara","year":"2008","unstructured":"Necoara, I., Suykens, J.A.K.: Application of a smoothing technique to decomposition in convex optimization. IEEE Trans. Autom. Control 53(11), 2674\u20132679 (2008)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1015_CR44","volume-title":"Sequential Quadratic Programming","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Sequential Quadratic Programming. Springer, New York (2006)"},{"issue":"2","key":"1015_CR45","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. Global Optim. 72(2), 305\u2013321 (2018)","journal-title":"J. Global Optim."},{"key":"1015_CR46","doi-asserted-by":"crossref","unstructured":"Nowak, I., Muts, P., Hendrix, E.M.T.: Multi-tree decomposition methods for large-scale mixed integer nonlinear optimization. In: Large Scale Optimization in Supply Chains and Smart Manufacturing, pp. 27\u201358. Springer (2019)","DOI":"10.1007\/978-3-030-22788-3_2"},{"key":"1015_CR47","unstructured":"Gurobi Optimization: Gurobi optimizer reference manual (2009)"},{"key":"1015_CR48","volume-title":"Optimization","author":"MJD Powell","year":"1969","unstructured":"Powell, M.J.D.: A method for nonlinear constraints in minimization problems. In: Fletcher, R. (ed.) Optimization. Academic Press, Cambridge (1969)"},{"key":"1015_CR49","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, 937\u2013947 (1992)","journal-title":"Comput. Chem. Eng."},{"key":"1015_CR50","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0098-1354(96)00357-2","volume":"22","author":"DE Ravemark","year":"1998","unstructured":"Ravemark, D.E., Rippin, D.W.T.: Optimal design of a multi-product batch plant. Comput. Chem. Eng. 22, 177\u2013183 (1998)","journal-title":"Comput. Chem. Eng."},{"key":"1015_CR51","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Convex analysis (1970)","DOI":"10.1515\/9781400873173"},{"key":"1015_CR52","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s10107-007-0115-7","volume":"116","author":"J R\u00fcckmann","year":"2009","unstructured":"R\u00fcckmann, J., Shapiro, A.: Augmented Lagrangians in semi-infinite programming. Math. Program. Ser. B 116, 499\u2013512 (2009)","journal-title":"Math. Program. Ser. B"},{"key":"1015_CR53","unstructured":"Sawaya, N.: Reformulations, relaxations and cutting planes for generalized disjunctive programming. Ph.D. thesis, Carnegie Mellon University (2006)"},{"issue":"3","key":"1015_CR54","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1287\/moor.1040.0103","volume":"29","author":"A Shapiro","year":"2004","unstructured":"Shapiro, A., Sun, J.: Some properties of the augmented Lagrangian in cone constrained optimization. Math. Oper. Res. 29(3), 479\u2013491 (2004)","journal-title":"Math. Oper. Res."},{"key":"1015_CR55","first-page":"1","volume":"86","author":"R Takapoui","year":"2016","unstructured":"Takapoui, R., M\u00f6hle, N., Boyd, S., Bemporad, A.: A simple effective heuristic for embedded mixed-integer quadratic programming. Int. J. Control 86, 1\u201311 (2016)","journal-title":"Int. J. Control"},{"issue":"2","key":"1015_CR56","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":"1015_CR57","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1023\/A:1017501703105","volume":"109","author":"P Tseng","year":"2001","unstructured":"Tseng, P.: Convergence of a block coordinate descent method for nondifferentiable minimization. J. Optim. Theory Appl. 109(3), 475\u2013494 (2001)","journal-title":"J. Optim. Theory Appl."},{"key":"1015_CR58","first-page":"1","volume":"95","author":"JP Vielma","year":"2016","unstructured":"Vielma, J.P., Dunning, I., Huchette, J., Lubin, M.: Extended formulations in mixed integer conic quadratic programming. Math. Program. Comput. 95, 1\u201350 (2016)","journal-title":"Math. Program. Comput."},{"key":"1015_CR59","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0098-1354(95)87027-X","volume":"19","author":"T Westerlund","year":"1995","unstructured":"Westerlund, T., Pettersson, F.: A cutting plane method for solving convex MINLP problems. Comput. Chem. Eng. 19, 131\u2013136 (1995)","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"1015_CR60","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"S Wright","year":"2015","unstructured":"Wright, S.: Coordinate descent algorithms. Math. Program. Ser. B 151(1), 3\u201334 (2015)","journal-title":"Math. Program. Ser. B"},{"key":"1015_CR61","unstructured":"Zhang, W., Kalsi, K., Fuller, J., Elizondo, M., Chassin, D.: Aggregate model for heterogeneous thermostatically controlled loads with demand response. In: 2012 IEEE Power and Energy Society General Meeting, pp. 1\u20138 (2012)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01015-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01015-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01015-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T02:07:13Z","timestamp":1667009233000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01015-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,17]]},"references-count":61,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["1015"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01015-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,17]]},"assertion":[{"value":"9 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}