{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T07:38:02Z","timestamp":1767771482930,"version":"3.41.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T00:00:00Z","timestamp":1720137600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T00:00:00Z","timestamp":1720137600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1953199"],"award-info":[{"award-number":["1953199"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-18-1-0223"],"award-info":[{"award-number":["W911NF-18-1-0223"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s10107-024-02090-3","type":"journal-article","created":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T10:01:36Z","timestamp":1720173696000},"page":"1-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal methods for convex nested stochastic composite optimization"],"prefix":"10.1007","volume":"212","author":[{"given":"Zhe","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Guanghui","family":"Lan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,5]]},"reference":[{"key":"2090_CR1","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1137\/21M1406222","volume":"32","author":"K Balasubramanian","year":"2022","unstructured":"Balasubramanian, K., Ghadimi, S., Nguyen, A.: Stochastic multilevel composition optimization algorithms with level-independent convergence rates. SIAM J. Optim. 32, 519\u2013544 (2022)","journal-title":"SIAM J. Optim."},{"key":"2090_CR2","doi-asserted-by":"crossref","unstructured":"Beck, A.: First-order methods in optimization, SIAM, (2017)","DOI":"10.1137\/1.9781611974997"},{"key":"2090_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2, 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"key":"2090_CR4","doi-asserted-by":"publisher","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, 1779\u20131814 (2014)","journal-title":"SIAM J. Optim."},{"key":"2090_CR5","doi-asserted-by":"crossref","unstructured":"Ermoliev, Y.M.: A general stochastic programming problem. journal of cybernetics, Journal of Cybernetics, 1, pp. 106\u2013112 (1971)","DOI":"10.1080\/01969727108542906"},{"key":"2090_CR6","volume-title":"Methods of Stochastic Programming","author":"YM Ermoliev","year":"1976","unstructured":"Ermoliev, Y.M.: Methods of Stochastic Programming. Nauka, Moscow (1976)"},{"key":"2090_CR7","doi-asserted-by":"publisher","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":"2090_CR8","doi-asserted-by":"publisher","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."},{"key":"2090_CR9","doi-asserted-by":"publisher","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, 2341\u20132368 (2013)","journal-title":"SIAM J. Optim."},{"key":"2090_CR10","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1137\/18M1230542","volume":"30","author":"S Ghadimi","year":"2020","unstructured":"Ghadimi, S., Ruszczynski, A., Wang, M.: A single timescale stochastic approximation method for nested stochastic optimization. SIAM J. Optim. 30, 960\u2013979 (2020)","journal-title":"SIAM J. Optim."},{"key":"2090_CR11","unstructured":"Lan, G.: Efficient methods for stochastic composite optimization, manuscript, Georgia Institute of Technology, (2008)"},{"key":"2090_CR12","doi-asserted-by":"crossref","unstructured":"Lan, G.: An optimal method for stochastic composite optimization, Mathematical Programming, , pp. 365\u2013397 (2012)","DOI":"10.1007\/s10107-010-0434-y"},{"key":"2090_CR13","doi-asserted-by":"publisher","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 nonsmooth convex optimization. Math. Program. 149, 1\u201345 (2015)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"2090_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10107-015-0955-5","volume":"159","author":"G Lan","year":"2016","unstructured":"Lan, G.: Gradient sliding for composite optimization. Math. Program. 159(1\u20132), 201\u2013235 (2016)","journal-title":"Math. Program."},{"key":"2090_CR15","doi-asserted-by":"crossref","unstructured":"Lan, G.: Lectures on Optimization Methods for Machine Learning, Springer-Nature, (2020)","DOI":"10.1007\/978-3-030-39568-1_1"},{"key":"2090_CR16","unstructured":"Lan, G., Ouyang, Y.: Accelerated gradient sliding for structured convex optimization, Computational Optimization and Applications, under revision (2020)"},{"key":"2090_CR17","unstructured":"Lan, G., Zhang, Z.: Optimal methods for risk averse distributed optimization, arXiv preprint arXiv:2203.05117, (2022)"},{"key":"2090_CR18","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10107-017-1173-0","volume":"171","author":"G Lan","year":"2018","unstructured":"Lan, G., Zhou, Y.: An optimal randomized incremental gradient method. Math. Program. 171, 167\u2013215 (2018)","journal-title":"Math. Program."},{"key":"2090_CR19","doi-asserted-by":"publisher","first-page":"2753","DOI":"10.1137\/17M1157891","volume":"28","author":"G Lan","year":"2018","unstructured":"Lan, G., Zhou, Y.: Random gradient extrapolation for distributed and stochastic optimization. SIAM J. Optim. 28, 2753\u20132782 (2018)","journal-title":"SIAM J. Optim."},{"key":"2090_CR20","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10107-015-0943-9","volume":"158","author":"AS Lewis","year":"2016","unstructured":"Lewis, A.S., Wright, S.J.: A proximal method for composite minimization. Math. Program. 158, 501\u2013546 (2016)","journal-title":"Math. Program."},{"key":"2090_CR21","unstructured":"Nemirovsky, A.S., Yudin, D.B.: Problem complexity and method efficiency in optimization., John Wiley UK\/USA, (1983)"},{"key":"2090_CR22","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Introductory lectures on convex optimization: A basic course, vol. 87, Springer Science & Business Media, (2003)","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"2090_CR23","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103, 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"2090_CR24","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite objective function. core discussion papers 2007076, universit\u00e9 catholique de louvain, Center for Operations Research and Econometrics (CORE), 5 (2007)"},{"key":"2090_CR25","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Convex analysis, Princeton university press, (1970)","DOI":"10.1515\/9781400873173"},{"key":"2090_CR26","doi-asserted-by":"publisher","first-page":"2301","DOI":"10.1137\/20M1312952","volume":"59","author":"A Ruszczynski","year":"2021","unstructured":"Ruszczynski, A.: A stochastic subgradient method for nonsmooth nonconvex multilevel composition optimization. SIAM J. Control. Optim. 59, 2301\u20132320 (2021)","journal-title":"SIAM J. Control. Optim."},{"key":"2090_CR27","volume-title":"On accelerated proximal gradient methods for convex-concave optimization, manuscript","author":"P Tseng","year":"2008","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization, manuscript. University of Washington, USA (2008)"},{"key":"2090_CR28","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s10107-016-1017-3","volume":"161","author":"M Wang","year":"2017","unstructured":"Wang, M., Fang, E.X., Liu, H.: Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions. Math. Program. 161, 419\u2013449 (2017)","journal-title":"Math. Program."},{"key":"2090_CR29","first-page":"3721","volume":"18","author":"M Wang","year":"2017","unstructured":"Wang, M., Liu, J., Fang, E.X.: Accelerating stochastic composition optimization, The. J. Mach. Learn. Res. 18, 3721\u20133743 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"2090_CR30","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1137\/18M1164846","volume":"29","author":"S Yang","year":"2019","unstructured":"Yang, S., Wang, M., Fang, E.X.: Multilevel stochastic gradient methods for nested composition optimization. SIAM J. Optim. 29, 616\u2013659 (2019)","journal-title":"SIAM J. Optim."},{"key":"2090_CR31","unstructured":"Zhang, J., Xiao, L.: Multi-level composite stochastic optimization via nested variance reduction, arXiv preprint arXiv:1908.11468, (2019)"},{"key":"2090_CR32","unstructured":"Zhang, Z., Ahmed, S., Lan, G.: Efficient algorithms for distributionally robust stochastic optimization with discrete scenario support, arXiv preprint arXiv:1909.11216, (2019)"},{"key":"2090_CR33","unstructured":"Zhang, Z., Lan, G.: Optimal algorithms for convex nested stochastic composite optimization, arXiv preprint arXiv:2011.10076, (2020)"},{"key":"2090_CR34","unstructured":"Zhang, Z., Lan, G.: Solving convex smooth function constrained optimization is as almost easy as unconstrained optimization, arXiv preprint arXiv:2210.05807, (2022)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02090-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02090-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02090-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:02:56Z","timestamp":1750176176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02090-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,5]]},"references-count":34,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2090"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02090-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2024,7,5]]},"assertion":[{"value":"4 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}