{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:33Z","timestamp":1740122673202,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T00:00:00Z","timestamp":1684800000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T00:00:00Z","timestamp":1684800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001459","name":"Ministry of Education, Singapore","doi-asserted-by":"crossref","award":["MOE-2019-T3-1-010"],"award-info":[{"award-number":["MOE-2019-T3-1-010"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10589-023-00493-0","type":"journal-article","created":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T13:02:18Z","timestamp":1684846938000},"page":"117-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2348-6133","authenticated-orcid":false,"given":"Kuang-Yu","family":"Ding","sequence":"first","affiliation":[]},{"given":"Xin-Yee","family":"Lam","sequence":"additional","affiliation":[]},{"given":"Kim-Chuan","family":"Toh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,23]]},"reference":[{"issue":"3","key":"493_CR1","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. Math. 4(3), 238\u2013252 (1962)","journal-title":"Numer. Math."},{"key":"493_CR2","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1287\/opre.50.5.904.360","volume":"50","author":"A Berkelaar","year":"2002","unstructured":"Berkelaar, A., Dert, C., Oldenkamp, B., Zhang, S.: A primal-dual decomposition-based interior point approach to two-stage stochastic linear programming. Oper. Res. 50, 904\u2013915 (2002)","journal-title":"Oper. Res."},{"key":"493_CR3","unstructured":"Birge, J.R.: Current trends in stochastic programming computation and applications. Technique Report 95-15, Department of Industrial and Operations Engineering, University of Michigan (1995)"},{"key":"493_CR4","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1287\/mnsc.34.12.1472","volume":"34","author":"JR Birge","year":"1988","unstructured":"Birge, J.R., Qi, L.: Computing block-angular Karmarkar projections with applications to stochastic programming. Manag. Sci. 34, 1472\u20131479 (1988)","journal-title":"Manag. Sci."},{"key":"493_CR5","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10107-014-0808-7","volume":"152","author":"N Chatzipanagiotis","year":"2015","unstructured":"Chatzipanagiotis, N., Dentcheva, D., Zavlanos, M.M.: An augmented Lagrangian method for distributed optimization. Math. Program. 152, 405\u2013434 (2015)","journal-title":"Math. Program."},{"key":"493_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10107-019-01423-x","volume":"185","author":"L Chen","year":"2021","unstructured":"Chen, L., Li, X.D., Sun, D.F., Toh, K.C.: On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming. Math. Program. 185, 111\u2013161 (2021)","journal-title":"Math. Program."},{"key":"493_CR7","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1137\/080742026","volume":"21","author":"M Chen","year":"2011","unstructured":"Chen, M., Mehrotra, S.: Self-concordance and decomposition based interior point methods for the two stage stochastic convex optimization problem. SIAM J. Optim. 21, 1667\u20131687 (2011)","journal-title":"SIAM J. Optim."},{"key":"493_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10107-016-1007-5","volume":"161","author":"L Chen","year":"2017","unstructured":"Chen, L., Sun, D.F., Toh, K.C.: An efficient inexact symmetric Gauss\u2013Seidel based majorized ADMM for high-dimensional convex composite conic programming. Math. Program. 161, 237\u2013270 (2017)","journal-title":"Math. Program."},{"key":"493_CR9","doi-asserted-by":"publisher","first-page":"174","DOI":"10.2307\/1907876","volume":"23","author":"G Dantzig","year":"1955","unstructured":"Dantzig, G.: Upper bounds, secondary constraints and block triangularity in linear programming. Econometrica 23, 174\u2013183 (1955)","journal-title":"Econometrica"},{"issue":"7","key":"493_CR10","doi-asserted-by":"publisher","first-page":"2146","DOI":"10.1287\/mnsc.2016.2461","volume":"63","author":"M Fischetti","year":"2017","unstructured":"Fischetti, M., Ljubi\u0107, I., Sinnl, M.: Redesigning Benders decomposition for large-scale facility location. Manag. Sci. 63(7), 2146\u20132162 (2017)","journal-title":"Manag. Sci."},{"key":"493_CR11","unstructured":"G$$\\stackrel{..}{\\rm u}$$nl$$\\stackrel{..}{\\rm u}$$k, O., Lee, J., Weismantel, R.: MINLP strengthening for separable convex quadratic transportation-cost UFL. Technical Report RC24213 (W0703-042), Research Division, IBM, Yorktown Heights, NY (2007)"},{"issue":"4","key":"493_CR12","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial time algorithm for linear programming. Combinatorica 4(4), 373\u2013395 (1984)","journal-title":"Combinatorica"},{"key":"493_CR13","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF02680549","volume":"83","author":"S Kontogiorgis","year":"1998","unstructured":"Kontogiorgis, S., Meyer, R.: A variable-penalty alternating directions method for convex optimization. Math. Program. 83, 29\u201353 (1998)","journal-title":"Math. Program."},{"issue":"3","key":"493_CR14","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/ijoo.2019.0048","volume":"3","author":"XY Lam","year":"2021","unstructured":"Lam, X.Y., Sun, D., Toh, K.C.: Semi-proximal augmented Lagrangian-based decomposition methods for primal block-angular convex composite quadratic conic programming problems. Informs J. Optim. 3(3), 254\u2013277 (2021)","journal-title":"Informs J. Optim."},{"key":"493_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0377-0427(00)00545-8","volume":"129","author":"KK Lau","year":"2001","unstructured":"Lau, K.K., Womersley, R.S.: Multistage quadratic stochastic programming. J. Comput. Appl. Math. 129, 105\u2013138 (2001)","journal-title":"J. Comput. Appl. Math."},{"issue":"01","key":"493_CR16","doi-asserted-by":"publisher","first-page":"2050035","DOI":"10.1142\/S0217595920500359","volume":"38","author":"M Li","year":"2021","unstructured":"Li, M., Wu, Z.: On the convergence rate of inexact majorized sGS ADMM with indefinite proximal terms for convex composite programming. Asia-Pac. J. Oper. Res. 38(01), 2050035 (2021)","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"493_CR17","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/16M1097572","volume":"28","author":"XD Li","year":"2018","unstructured":"Li, X.D., Sun, D.F., Toh, K.C.: A highly efficient semismooth Newton augmented Lagrangian method for solving Lasso problems. SIAM J. Optim. 28, 433\u2013458 (2018)","journal-title":"SIAM J. Optim."},{"key":"493_CR18","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10107-018-1247-7","volume":"175","author":"XD Li","year":"2019","unstructured":"Li, X.D., Sun, D.F., Toh, K.C.: A block symmetric Gauss\u2013Seidel decomposition theorem for convex composite quadratic programming and its applications. Math. Program. 175, 395\u2013418 (2019)","journal-title":"Math. Program."},{"key":"493_CR19","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s10589-013-9542-y","volume":"55","author":"M Lubin","year":"2013","unstructured":"Lubin, M., Hall, J.A.J., Petra, C.G., Anitescu, M.: Parallel distributed-memory simplex for large-scale stochastic LP problems. Comput. Optim. Appl. 55, 571\u2013596 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"493_CR20","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1137\/050622067","volume":"18","author":"S Mehrotra","year":"2007","unstructured":"Mehrotra, S., \u00d6zevin, M.: Decomposition-based interior point methods for two-stage stochastic semidefinite programming. SIAM J. Optim. 18, 206\u2013222 (2007)","journal-title":"SIAM J. Optim."},{"key":"493_CR21","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1287\/opre.1080.0659","volume":"57","author":"S Mehrotra","year":"2009","unstructured":"Mehrotra, S., \u00d6zevin, M.: Decomposition based interior point methods for two-stage stochastic convex quadratic programs with recourse. Oper. Res. 57, 964\u2013974 (2009)","journal-title":"Oper. Res."},{"key":"493_CR22","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/moor.16.1.119","volume":"16","author":"RT Rockafellar","year":"1991","unstructured":"Rockafellar, R.T., Wets, R.: Scenarios and policy aggregation in optimization under uncertainty. Math. Oper. Res. 16, 119\u2013147 (1991)","journal-title":"Math. Oper. Res."},{"key":"493_CR23","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1287\/moor.20.3.634","volume":"20","author":"A Ruszczy\u0144ski","year":"1995","unstructured":"Ruszczy\u0144ski, A.: On convergence of an augmented Lagrangian decomposition method for sparse convex optimization. Math. Oper. Res. 20, 634\u2013656 (1995)","journal-title":"Math. Oper. Res."},{"key":"493_CR24","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1023\/A:1018965626303","volume":"85","author":"A Ruszczy\u0144ski","year":"1999","unstructured":"Ruszczy\u0144ski, A.: Some advances in decomposition methods for stochastic linear programming. Ann. Oper. Res. 85, 153\u2013172 (1999)","journal-title":"Ann. Oper. Res."},{"key":"493_CR25","doi-asserted-by":"publisher","first-page":"1655","DOI":"10.3934\/jimo.2019022","volume":"16","author":"J Sun","year":"2020","unstructured":"Sun, J., Xu, H.L., Zhang, M.: A new interpretation of the progressive hedging algorithm for multistage stochastic minimization problems. J. Ind. Manag. Optim. 16, 1655\u20131662 (2020)","journal-title":"J. Ind. Manag. Optim."},{"key":"493_CR26","unstructured":"Torres, J., Li, C., Apap, R., Grossmann, I.: A review on the performance of linear and mixed integer two-stage stochastic programming algorithms and software. Eprints for the optimization community (2019)"},{"issue":"4","key":"493_CR27","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"RM Van Slyke","year":"1969","unstructured":"Van Slyke, R.M., Wets, R.: L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. 17(4), 638\u2013663 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"493_CR28","unstructured":"Wollenberg, T.: Two-stage stochastic semidefinite programming: theory, algorithms, and application to AC power flow under uncertainty. Ph.D. Thesis, Universit\u00e4t Duisburg-Essen (2017)"},{"key":"493_CR29","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1023\/A:1021850714072","volume":"102","author":"G Zhao","year":"1999","unstructured":"Zhao, G.: Interior-point methods with decomposition for solving large-scale linear programs. J. Optim. Theory Appl. 102, 169\u2013192 (1999)","journal-title":"J. Optim. Theory Appl."},{"key":"493_CR30","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/PL00011433","volume":"90","author":"G Zhao","year":"2001","unstructured":"Zhao, G.: A log-barrier method with Benders decomposition for solving two-stage stochastic programs. Math. Program. 90, 507\u2013536 (2001)","journal-title":"Math. Program."},{"key":"493_CR31","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s12532-012-0038-z","volume":"4","author":"V Zverovich","year":"2012","unstructured":"Zverovich, V., F\u00e1bi\u00e1n, C.I., Ellison, E.F.E., Mitra, G.: A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition. Math. Program. Comput. 4, 211\u2013238 (2012)","journal-title":"Math. Program. Comput."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00493-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00493-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00493-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T11:15:52Z","timestamp":1690283752000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00493-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,23]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["493"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00493-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2023,5,23]]},"assertion":[{"value":"5 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Statements and Declarations"}},{"value":"The research of Kim-Chuan Toh is supported by the Ministry of Education, Singapore, under its Academic Research Fund Tier 3 Grant call (MOE-2019-T3-1-010). All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Financial interest or Non-financial interest"}}]}}