{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:39:48Z","timestamp":1740148788565,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T00:00:00Z","timestamp":1674604800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T00:00:00Z","timestamp":1674604800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s12190-023-01840-4","type":"journal-article","created":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T18:03:20Z","timestamp":1674669800000},"page":"2389-2419","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scenario decomposable subgradient projection method for two-stage stochastic programming with convex risk measures"],"prefix":"10.1007","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6206-4219","authenticated-orcid":false,"given":"Haodong","family":"Yu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,25]]},"reference":[{"key":"1840_CR1","first-page":"141","volume-title":"Stochastic Programming, vol 10 of Handbooks in Operations Research and Management Science","author":"A Ruszczy\u0144ki","year":"2003","unstructured":"Ruszczy\u0144ki, A.: Decomposition methods. In: Shapiro, A., Ruszczy\u0144ki, A. (eds.) Stochastic Programming, vol 10 of Handbooks in Operations Research and Management Science, pp. 141\u2013211. Elsevier, Heidelberg (2003)"},{"key":"1840_CR2","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF01582895","volume":"52","author":"MVF Pereira","year":"1991","unstructured":"Pereira, M.V.F., Pinto, L.M.: Multi-stage stochastic optimization applied to energy planning. Math. Program. 52, 359\u2013375 (1991)","journal-title":"Math. Program."},{"issue":"4","key":"1840_CR3","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1016\/j.orl.2008.01.013","volume":"36","author":"AB Philpott","year":"2008","unstructured":"Philpott, A.B., Guan, Z.: On the convergence of stochastic dual dynamic programming and related methods. Oper. Res. Lett. 36(4), 450\u2013455 (2008)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"1840_CR4","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."},{"key":"1840_CR5","volume-title":"Topics in Stochastic Programming","author":"A Shapiro","year":"2011","unstructured":"Shapiro, A.: Topics in Stochastic Programming. CORE Lecture Series. Universite Catholique de Louvain, Louvain-la-Neuve (2011)"},{"key":"1840_CR6","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.J.B.: Scenario and policy aggregation in optimization under uncertainty. Math. Op. Res. 16, 119\u2013147 (1991)","journal-title":"Math. Op. Res."},{"issue":"1","key":"1840_CR7","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10107-018-1251-y","volume":"174","author":"RT Rockafellar","year":"2019","unstructured":"Rockafellar, R.T., Sun, J.: Solving monotone stochastic variational inequalities and complementarity problems by progressive hedging. Math. Program. 174(1), 453\u2013471 (2019)","journal-title":"Math. Program."},{"issue":"3","key":"1840_CR8","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1137\/17M1151067","volume":"29","author":"M Zhang","year":"2019","unstructured":"Zhang, M., Sun, J., Xu, H.: Two-stage quadratic games under uncertainty and their solution by progressive hedging algorithms. SIAM J. Optim. 29(3), 1799\u20131818 (2019)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1840_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1111\/1467-9965.00068","volume":"9","author":"P Artzner","year":"1999","unstructured":"Artzner, P., Delbaen, F., Eber, J.M., Heath, D.: Coherent measures of risk. Math. Financ. 9(3), 203\u2013228 (1999)","journal-title":"Math. Financ."},{"key":"1840_CR10","doi-asserted-by":"publisher","DOI":"10.1515\/9783110212075","volume-title":"Stochastic Finance: An Introduction in Discrete Time","author":"H F\u00f6llmer","year":"2004","unstructured":"F\u00f6llmer, H., Schied, A.: Stochastic Finance: An Introduction in Discrete Time. Walter de Gruyter, Berlin (2004)"},{"issue":"1","key":"1840_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10479-017-2441-3","volume":"262","author":"M Ang","year":"2018","unstructured":"Ang, M., Sun, J., Yao, Q.: On the dual representation of coherent risk measures. Ann. Op. Res. 262(1), 29\u201346 (2018)","journal-title":"Ann. Op. Res."},{"issue":"2","key":"1840_CR12","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.ejor.2011.10.056","volume":"218","author":"A Philpott","year":"2012","unstructured":"Philpott, A., de Matos, V.: Dynamic sampling algorithms for multi-stage stochastic programs with risk aversion. Eur. J. Op. Res. 218(2), 470\u2013483 (2012)","journal-title":"Eur. J. Op. Res."},{"key":"1840_CR13","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s10107-017-1131-x","volume":"168","author":"J Sun","year":"2018","unstructured":"Sun, J., Liao, L., Rodrigues, B.: Quadratic two-stage stochastic optimization with coherent measures of risk. Math. Program. 168, 599\u2013613 (2018)","journal-title":"Math. Program."},{"issue":"4","key":"1840_CR14","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1287\/opre.2013.1175","volume":"61","author":"A Philpott","year":"2013","unstructured":"Philpott, A., de Matos, V., Finardi, E.: On solving multistage stochastic programs with coherent risk measures. Op. Res. 61(4), 957\u2013970 (2013)","journal-title":"Op. Res."},{"issue":"2","key":"1840_CR15","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1137\/100811696","volume":"22","author":"V Guigues","year":"2012","unstructured":"Guigues, V., Rmisch, W.: Sampling-based decomposition methods for multistage stochastic programs based on extended polyhedral risk measures. SIAM J. Optim. 22(2), 286\u2013312 (2012)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1840_CR16","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s11228-017-0437-4","volume":"26","author":"RT Rockafellar","year":"2018","unstructured":"Rockafellar, R.T.: Solving stochastic programming problems with risk measures by progressive hedging. Set-Valued Var. Anal. 26(4), 759\u2013768 (2018)","journal-title":"Set-Valued Var. Anal."},{"key":"1840_CR17","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10107-020-01471-8","volume":"181","author":"J Sun","year":"2020","unstructured":"Sun, J., Yang, X., Yao, Q., Zhang, M.: Risk minimization, regret minimization and progressive hedging algorithms. Math. Program. 181, 509\u2013530 (2020)","journal-title":"Math. Program."},{"issue":"1","key":"1840_CR18","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10479-011-0935-y","volume":"200","author":"RA Collado","year":"2012","unstructured":"Collado, R.A., Papp, D., Ruszczy\u0144ski, A.: Scenario decomposition of risk-averse multistage stochastic programming problems. Ann. Op. Res. 200(1), 147\u2013170 (2012)","journal-title":"Ann. Op. Res."},{"key":"1840_CR19","unstructured":"Bauschke, H.H. (1996): Projection algorithms and monotone operators [PhD thesis] Canada. Simon Fraser University. Burnaby"},{"issue":"2","key":"1840_CR20","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-014-0769-x","volume":"150","author":"M Wang","year":"2015","unstructured":"Wang, M., Bertsekas, D.P.: Incremental constraint projection methods for variational inequalities. Math. Program. 150(2), 321\u2013363 (2015)","journal-title":"Math. Program."},{"issue":"3","key":"1840_CR21","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1080\/10556788.2016.1217210","volume":"32","author":"FQ Xia","year":"2017","unstructured":"Xia, F.Q., Ansari, Q.H., Yao, J.C.: A new incremental constraint projection method for solving monotone variational inequalities. Optim. Methods Softw. 32(3), 470\u2013502 (2017)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"1840_CR22","first-page":"236","volume":"44","author":"AN Iusem","year":"2019","unstructured":"Iusem, A.N., Jofr\u00e9, A., Thompson, P.: Incremental constraint projection methods for monotone stochastic variational inequalities. Math. Op. Res. 44(1), 236\u2013263 (2019)","journal-title":"Math. Op. Res."},{"key":"1840_CR23","unstructured":"Wang, M., Bertsekas, D.P.: Incremental constraint projection-proximal methods for non-smooth convex optimization. Cambridge (MA): Massachusetts Institute of Technology, Lab for Information and Decision Systems Report LIDS-P-2907. (2013)"},{"key":"1840_CR24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on Stochastic Programming: Modeling and Theory","author":"A Shapiro","year":"2009","unstructured":"Shapiro, A., Dentcheva, D., Ruszczy\u0144ki, A.: Lectures on Stochastic Programming: Modeling and Theory. SIAM, Philadelphia (2009)"},{"key":"1840_CR25","volume-title":"Convex Optimization Algorithms","author":"DP Bertsekas","year":"2015","unstructured":"Bertsekas, D.P.: Convex Optimization Algorithms. Athena Scientific, Belmont (2015)"},{"key":"1840_CR26","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.jat.2008.04.001","volume":"155","author":"F Deutsch","year":"2008","unstructured":"Deutsch, F., Hundal, H.: The rate of convergence for the cyclic projections algorithm iii: regularity of convex sets. J. Approx. Theory 155, 155\u2013184 (2008)","journal-title":"J. Approx. Theory"},{"key":"1840_CR27","first-page":"233","volume-title":"Optimizing Methods in Statistics","author":"H Robbins","year":"1971","unstructured":"Robbins, H., Siegmund, D.: A convergence theorem for nonnegative almost supermartingales and some applications. In: Rustagi, J.S. (ed.) Optimizing Methods in Statistics, pp. 233\u2013257. Academic Press, New York (1971)"},{"key":"1840_CR28","first-page":"263","volume-title":"Stochastic Optimization: Algorithms and Applications","author":"A Nedi\u0107","year":"2000","unstructured":"Nedi\u0107, A., Bertsekas, D.P.: Convergence rate of the incremental subgradient algorithm. In: Uryasev, S., Pardalos, P.M. (eds.) Stochastic Optimization: Algorithms and Applications, pp. 263\u2013304. Springer, Dordrecht (2000)"},{"key":"1840_CR29","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"DP Bertsekas","year":"2014","unstructured":"Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Academic Press, New York (2014)"},{"issue":"5","key":"1840_CR30","doi-asserted-by":"publisher","first-page":"1390","DOI":"10.1287\/opre.2018.1729","volume":"66","author":"R Jiang","year":"2018","unstructured":"Jiang, R., Guan, Y.: Risk-averse two-stage stochastic program with distributional ambiguity. Op. Res. 66(5), 1390\u20131405 (2018)","journal-title":"Op. Res."},{"issue":"3","key":"1840_CR31","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.2017.1698","volume":"66","author":"GA Hanasusanto","year":"2018","unstructured":"Hanasusanto, G.A., Kuhn, D.: Conic programming reformulations of two-stage distributionally robust linear programs over wasserstein balls. Op. Res. 66(3), 849\u2013869 (2018)","journal-title":"Op. Res."},{"issue":"1","key":"1840_CR32","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10589-020-00234-7","volume":"78","author":"Y Chen","year":"2021","unstructured":"Chen, Y., Sun, H., Xu, H.: Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems. Comput. Optim. Appl. 78(1), 205\u2013238 (2021)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1840_CR33","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1287\/moor.12.2.224","volume":"12","author":"A Ben-Tal","year":"1987","unstructured":"Ben-Tal, A., Teboulle, M.: Penalty functions and duality in stochastic programming via $$\\phi $$-divergence functionals. Math. Op. Res. 12(2), 224\u2013240 (1987)","journal-title":"Math. Op. Res."},{"key":"1840_CR34","doi-asserted-by":"crossref","unstructured":"Bayraksan, G., Love, D.K.: Data-driven stochastic programming using phi-divergences. In: Aleman, M., Aur\u00e9lie, C., Thiele (eds.) Tutorials in Operations Research, INFORMS Catonsville (2015)","DOI":"10.1287\/educ.2015.0134"},{"key":"1840_CR35","volume-title":"Stochastic Decomposition: A Statistical Method for Large Scale Stochastic Linear Programming","author":"JL Higle","year":"2013","unstructured":"Higle, J.L., Sen, S.: Stochastic Decomposition: A Statistical Method for Large Scale Stochastic Linear Programming. Springer, Dordrecht (2013)"},{"issue":"2","key":"1840_CR36","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s10479-020-03811-5","volume":"295","author":"G Bareilles","year":"2020","unstructured":"Bareilles, G., Laguel, Y., Grishchenko, D., Iutzeler, F., Malick, J.: Randomized progressive hedging methods for multi-stage stochastic programming. Ann. Op. Res. 295(2), 535\u2013560 (2020)","journal-title":"Ann. Op. Res."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01840-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-023-01840-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01840-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T15:24:09Z","timestamp":1685114649000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-023-01840-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,25]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1840"],"URL":"https:\/\/doi.org\/10.1007\/s12190-023-01840-4","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2023,1,25]]},"assertion":[{"value":"8 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}