{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:46:25Z","timestamp":1774946785304,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T00:00:00Z","timestamp":1584662400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T00:00:00Z","timestamp":1584662400000},"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":["Math. Program."],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s10107-020-01489-y","type":"journal-article","created":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T18:02:40Z","timestamp":1584727360000},"page":"487-532","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Dynamic stochastic approximation for multi-stage stochastic optimization"],"prefix":"10.1007","volume":"187","author":[{"given":"Guanghui","family":"Lan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiqiang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,20]]},"reference":[{"key":"1489_CR1","series-title":"Stanford Mathematical Studies in the Social Sciences","volume-title":"Studies in Linear and Non-linear Programming","author":"K Arrow","year":"1958","unstructured":"Arrow, K., Hurwicz, L., Uzawa, H.: Studies in Linear and Non-linear Programming. Stanford Mathematical Studies in the Social Sciences. Stanford University Press, Palo Alto (1958)"},{"key":"1489_CR2","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"1997","unstructured":"Birge, J.R., Louveaux, F.V.: Introduction to Stochastic Programming. Springer, New York (1997)"},{"key":"1489_CR3","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vision 40, 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vision"},{"issue":"4","key":"1489_CR4","doi-asserted-by":"crossref","first-page":"1779","DOI":"10.1137\/130919362","volume":"24","author":"Y Chen","year":"2014","unstructured":"Chen, Y., Lan, G., Ouyang, Y.: Optimal primal-dual methods for a class of saddle point problems. SIAM J. Optim. 24(4), 1779\u20131814 (2014)","journal-title":"SIAM J. Optim."},{"key":"1489_CR5","unstructured":"Dai, B., He, N., Pan, Y., Boots, B., Song, L.: Learning from conditional distributions via dual embeddings. In: Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, pp. 1458\u20131467. (2017)"},{"issue":"1","key":"1489_CR6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02282041","volume":"45","author":"George B Dantzig","year":"1993","unstructured":"Dantzig, George B., Infanger, Gerd: Multi-stage stochastic linear programs for portfolio optimization. Ann. Oper. Res. 45(1), 59\u201376 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"1489_CR7","first-page":"20","volume":"1","author":"Christopher J Donohue","year":"2006","unstructured":"Donohue, Christopher J., Birge, John R.: The abridged nested decomposition method for multistage stochastic linear programs with relatively complete recourse. Algorithm. Oper. Res. 1(1), 20\u201330 (2006)","journal-title":"Algorithm. Oper. Res."},{"key":"1489_CR8","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1137\/110848864","volume":"22","author":"S Ghadimi","year":"2012","unstructured":"Ghadimi, S., Lan, G.: Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization, I: a generic algorithmic framework. SIAM J. Optim. 22, 1469\u20131492 (2012)","journal-title":"SIAM J. Optim."},{"key":"1489_CR9","doi-asserted-by":"crossref","first-page":"2061","DOI":"10.1137\/110848876","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization, II: shrinking procedures and optimal algorithms. SIAM J. Optim. 23, 2061\u20132089 (2013)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1489_CR10","doi-asserted-by":"crossref","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Stochastic first- and zeroth-order methods for nonconvex stochastic programming. SIAM J. Optim. 23(4), 2341\u20132368 (2013)","journal-title":"SIAM J. Optim."},{"key":"1489_CR11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2015","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Program. 156, 59\u201399 (2015)","journal-title":"Math. Program."},{"key":"1489_CR12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s10107-014-0846-1","volume":"155","author":"S Ghadimi","year":"2014","unstructured":"Ghadimi, S., Lan, G., Zhang, H.: Mini-batch stochastic approximation methods for constrained nonconvex stochastic programming. Math. Program. 155, 267\u2013305 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"1489_CR13","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"Bingsheng He","year":"2012","unstructured":"He, Bingsheng, Yuan, Xiaoming: On the o(1\/n) convergence rate of the douglas-rachford alternating direction method. SIAM J. Numer. Anal. 50(2), 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"key":"1489_CR14","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1287\/moor.16.3.650","volume":"16","author":"JL Higle","year":"1991","unstructured":"Higle, J.L., Sen, S.: Stochastic decomposition: an algorithm for two-stage linear programs with recourse. Math. Oper. Res. 16, 650\u2013669 (1991)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1489_CR15","first-page":"2","volume":"6","author":"Magnus Hindsberger","year":"2014","unstructured":"Hindsberger, Magnus, Philpott, A.B.: Resa: a method for solving multistage stochastic linear programs. J. Appl. Oper. Res. 6(1), 2\u201315 (2014)","journal-title":"J. Appl. Oper. Res."},{"issue":"1\u20132","key":"1489_CR16","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10107-014-0787-8","volume":"152","author":"V\u00e1clav Kozm\u00edk","year":"2015","unstructured":"Kozm\u00edk, V\u00e1clav, Morton, David P.: Evaluating policies in risk-averse multi-stage stochastic programming. Math. Program. 152(1\u20132), 275\u2013300 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"1489_CR17","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-010-0434-y","volume":"133","author":"G Lan","year":"2012","unstructured":"Lan, G.: An optimal method for stochastic composite optimization. Math. Program. 133(1), 365\u2013397 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"1489_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-013-0737-x","volume":"149","author":"G Lan","year":"2015","unstructured":"Lan, G.: Bundle-level type methods uniformly optimal for smooth and non-smooth convex optimization. Math. Program. 149(1), 1\u201345 (2015)","journal-title":"Math. Program."},{"key":"1489_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-008-0261-6","volume":"126","author":"G Lan","year":"2011","unstructured":"Lan, G., Lu, Z., Monteiro, R.D.C.: Primal-dual first-order methods with $${\\cal{O}}(1\/\\epsilon )$$ iteration-complexity for cone programming. Math. Program. 126, 1\u201329 (2011)","journal-title":"Math. Program."},{"key":"1489_CR20","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s10107-011-0442-6","volume":"134","author":"G Lan","year":"2012","unstructured":"Lan, G., Nemirovski, A.S., Shapiro, A.: Validation analysis of mirror descent stochastic approximation method. Math. Program. 134, 425\u2013458 (2012)","journal-title":"Math. Program."},{"key":"1489_CR21","first-page":"161","volume":"171","author":"Guanghui Lan","year":"2018","unstructured":"Lan, Guanghui, Yi, Zhou: An optimal randomized incremental gradient method. Math. Program. 171, 161\u2013215 (2018)","journal-title":"Math. Program."},{"key":"1489_CR22","doi-asserted-by":"crossref","first-page":"2755","DOI":"10.1137\/090753127","volume":"20","author":"RDC Monteiro","year":"2010","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: On the complexity of the hybrid proximal projection method for the iterates and the ergodic mean. SIAM J. Optim. 20, 2755\u20132787 (2010)","journal-title":"SIAM J. Optim."},{"key":"1489_CR23","first-page":"1179","volume":"12","author":"A Nedi\u0107","year":"2012","unstructured":"Nedi\u0107, A.: On stochastic subgradient mirror-descent algorithm with weighted averaging. Optim. Lett. 12, 1179\u20131197 (2012)","journal-title":"Optim. Lett."},{"key":"1489_CR24","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"AS Nemirovski","year":"2005","unstructured":"Nemirovski, A.S.: Prox-method with rate of convergence $$o(1\/t)$$ for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. 15, 229\u2013251 (2005)","journal-title":"SIAM J. Optim."},{"key":"1489_CR25","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"AS Nemirovski","year":"2009","unstructured":"Nemirovski, A.S., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19, 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"1489_CR26","series-title":"Wiley-Interscience Series in Discrete Mathematics","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"AS Nemirovski","year":"1993","unstructured":"Nemirovski, A.S., Yudin, D.: Problem Complexity and Method Efficiency in Optimization. Wiley-Interscience Series in Discrete Mathematics. Wiley, Hoboken (1993)"},{"key":"1489_CR27","first-page":"543","volume":"269","author":"YE Nesterov","year":"1983","unstructured":"Nesterov, Y.E.: A method for unconstrained convex minimization problem with the rate of convergence $$O(1\/k^2)$$. Doklady AN SSSR 269, 543\u2013547 (1983)","journal-title":"Doklady AN SSSR"},{"key":"1489_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"YE Nesterov","year":"2004","unstructured":"Nesterov, Y.E.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, Massachusetts (2004)"},{"key":"1489_CR29","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"YE Nesterov","year":"2005","unstructured":"Nesterov, Y.E.: Smooth minimization of nonsmooth functions. Math. Program. 103, 127\u2013152 (2005)","journal-title":"Math. Program."},{"issue":"1","key":"1489_CR30","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1137\/14095697X","volume":"8","author":"Y Ouyang","year":"2014","unstructured":"Ouyang, Y., Chen, Y., Lan, G., Pasiliao, E.: An accelerated linearized alternating direction method of multipliers. SIAM J. Imaging Sci. 8(1), 644\u2013681 (2014)","journal-title":"SIAM J. Imaging Sci."},{"issue":"4","key":"1489_CR31","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1111\/1467-8586.00181","volume":"55","author":"Christian S Pedersen","year":"2003","unstructured":"Pedersen, Christian S., Satchell, Stephen E.: Utility functions whose parameters depend on initial wealth. Bull. Econ. Res. 55(4), 357\u2013371 (2003)","journal-title":"Bull. Econ. Res."},{"issue":"1\u20133","key":"1489_CR32","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01582895","volume":"52","author":"Mario VF Pereira","year":"1991","unstructured":"Pereira, Mario V.F., Pinto, Leontina M.V.G.: Multi-stage stochastic optimization applied to energy planning. Math. Program. 52(1\u20133), 359\u2013375 (1991)","journal-title":"Math. Program."},{"key":"1489_CR33","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1287\/opre.2013.1175","volume":"61","author":"A Philpott","year":"2013","unstructured":"Philpott, A., Matos, Vd, Finardi, E.: On solving multistage stochastic programs with coherent risk measures. Oper. Res. 61, 957\u2013970 (2013)","journal-title":"Oper. Res."},{"key":"1489_CR34","first-page":"98","volume":"7","author":"BT Polyak","year":"1990","unstructured":"Polyak, B.T.: New stochastic approximation type procedures. Automat. i Telemekh. 7, 98\u2013107 (1990)","journal-title":"Automat. i Telemekh."},{"key":"1489_CR35","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1137\/0330046","volume":"30","author":"BT Polyak","year":"1992","unstructured":"Polyak, B.T., Juditsky, A.B.: Acceleration of stochastic approximation by averaging. SIAM J. Control Optim. 30, 838\u2013855 (1992)","journal-title":"SIAM J. Control Optim."},{"key":"1489_CR36","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. 22, 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"key":"1489_CR37","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"issue":"1","key":"1489_CR38","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/moor.16.1.119","volume":"16","author":"R Tyrrell Rockafellar","year":"1991","unstructured":"Tyrrell Rockafellar, R., Wets, Roger J.-B.: Scenarios and policy aggregation in optimization under uncertainty. Math. Oper. Res. 16(1), 119\u2013147 (1991)","journal-title":"Math. Oper. Res."},{"key":"1489_CR39","doi-asserted-by":"crossref","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\u0144ski, A.: Lectures on Stochastic Programming: Modeling and Theory. SIAM, Philadelphia (2009)"},{"key":"1489_CR40","unstructured":"Shapiro, A., Nemirovski, A.: On complexity of stochastic programming problems. http:\/\/www.optimization-online.org, (2004). Accessed Oct 2004"},{"key":"1489_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.orl.2005.02.003","volume":"34","author":"A Shaprio","year":"2006","unstructured":"Shaprio, A.: On complexity of multistage stochastic programs. Oper. Res. Lett. 34, 1\u20138 (2006)","journal-title":"Oper. Res. Lett."},{"key":"1489_CR42","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.ejor.2010.08.007","volume":"209","author":"A Shaprio","year":"2011","unstructured":"Shaprio, A.: Analysis of stochastic dual dynamic programming method. Eur. J. Oper. Res. 209, 63\u201372 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"1489_CR43","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1017\/CBO9780511794308.00","volume-title":"Compressed Sensing: Theory and Applications","author":"R Vershynin","year":"2012","unstructured":"Vershynin, R.: Introduction to the non-asymptotic analysis of random matrices. In: Eldar, Y., Kutyniok, G. (eds.) Compressed Sensing: Theory and Applications, pp. 210\u2013268. Cambridge University Press, Cambridge (2012). https:\/\/doi.org\/10.1017\/CBO9780511794308.00"},{"issue":"1\u20132","key":"1489_CR44","first-page":"419","volume":"161","author":"M Wang","year":"2016","unstructured":"Wang, M., Fang, E.X., Liu, H.: Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions. Math. Program. 161(1\u20132), 419\u2013449 (2016)","journal-title":"Math. Program."},{"key":"1489_CR45","first-page":"235","volume":"27","author":"Xiao Wang","year":"2017","unstructured":"Wang, Xiao, Ma, S., GOLDFARB, D., Liu, W.: Stochastic quasi-newton methods for nonconvex stochastic optimization. SIAM J. Optim. 27, 235\u2013247 (2017)","journal-title":"SIAM J. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01489-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-020-01489-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01489-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,20]],"date-time":"2021-04-20T18:50:46Z","timestamp":1618944646000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-020-01489-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,20]]},"references-count":45,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["1489"],"URL":"https:\/\/doi.org\/10.1007\/s10107-020-01489-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,20]]},"assertion":[{"value":"2 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}