{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T10:59:55Z","timestamp":1772276395506,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T00:00:00Z","timestamp":1673481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T00:00:00Z","timestamp":1673481600000},"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 Optim Theory Appl"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10957-022-02157-1","type":"journal-article","created":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T14:02:58Z","timestamp":1673532178000},"page":"810-828","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Accelerated Stochastic Variance Reduction for a Class of Convex Optimization Problems"],"prefix":"10.1007","volume":"196","author":[{"given":"Lulu","family":"He","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0421-2900","authenticated-orcid":false,"given":"Jimin","family":"Ye","sequence":"additional","affiliation":[]},{"given":"E.","family":"Jianwei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,12]]},"reference":[{"issue":"221","key":"2157_CR1","first-page":"1","volume":"18","author":"Z Allen-Zhu","year":"2018","unstructured":"Allen-Zhu, Z.: Katyusha: the first direct acceleration of stochastic gradient methods. J. Mach. Learn. Res. 18(221), 1\u201351 (2018)","journal-title":"J. Mach. Learn. Res."},{"key":"2157_CR2","unstructured":"Allen-Zhu, Z.: Katyusha X: Simple momentum method for stochastic sum-of-nonconvex optimization. In: Jennifer, D., Andreas, K. (eds.) Proceedings of the 35th International Conference on Machine Learning, vol. 80, pp. 179\u2013185 (2018)"},{"key":"2157_CR3","doi-asserted-by":"crossref","unstructured":"Beck, A.: First-Order Methods in Optimization. In: MOS-SIAM, Series on Optimization. SIAM, Philadelhia (2017)","DOI":"10.1137\/1.9781611974997"},{"issue":"1","key":"2157_CR4","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. Image Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Image Sci."},{"key":"2157_CR5","doi-asserted-by":"crossref","unstructured":"Bottou, L.: Large-scale machine learning with stochastic gradient descent. In: Proceedings of Computational Statistics. pp. 177\u2013186 (2010)","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"2157_CR6","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1007\/s11590-018-1331-1","volume":"13","author":"V Cevher","year":"2019","unstructured":"Cevher, V., Vu, B.C.: On the linear convergence of the stochastic gradient method with constant step-size. Optim. Lett. 13, 1177\u20131187 (2019)","journal-title":"Optim. Lett."},{"key":"2157_CR7","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: SAGA: a fast incremental gradient method with support for non-strongly convex composite objectives. In: Ghahramani, Z., Welling, M., Cortes, C., Lawrence, N., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 27, pp. 1\u20139 (2014)"},{"issue":"4","key":"2157_CR8","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. Optimi. 23(4), 2341\u20132368 (2013)","journal-title":"SIAM J. Optimi."},{"key":"2157_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Program. 156, 59\u201399 (2016)","journal-title":"Math. Program."},{"key":"2157_CR10","unstructured":"Ghadimi, S., Lan, G.: Unified convergence analysis of stochastic momentum methods for convex and non-convex optimization. arXiv:1604.03257v2 (2016)"},{"key":"2157_CR11","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. In: Burges, C.J.C., Bottou, L., Welling, M., Ghahramani, Z., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 26, pp. 315\u2013323 (2013)"},{"key":"2157_CR12","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s11263-008-0168-y","volume":"81","author":"S Klein","year":"2009","unstructured":"Klein, S., Pluim, J., Staring, M., Viergever, M.A.: Adaptive stochastic gradient descent optimisation for image registration. Int. J. Comput. Vis. 81, 227\u2013239 (2009)","journal-title":"Int. J. Comput. Vis."},{"key":"2157_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10107-010-0434-y","volume":"133","author":"L Lan","year":"2012","unstructured":"Lan, L.: An optimal method for stochastic composite optimization. Math. Program. 133, 365\u2013397 (2012)","journal-title":"Math. Program."},{"key":"2157_CR14","unstructured":"Le Roux, N., Schmidt, M., Bach, F.: A stochastic gradient method with an exponential convergence rate for finite training sets. In: Burges, C.J.C., Bottou, L., Welling, M., Ghahramani, Z., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 25, pp. 1\u20139 (2012)"},{"key":"2157_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-2910-8","volume-title":"Accelerated Optimization for Machine Learning: First-Order Algorithms","author":"Z Lin","year":"2020","unstructured":"Lin, Z., Li, H., Fang, C.: Accelerated Optimization for Machine Learning: First-Order Algorithms. Springer, Singapore (2020)"},{"key":"2157_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2021.108201","volume":"188","author":"Z Luo","year":"2021","unstructured":"Luo, Z., Chen, S., Qian, Y., Hou, Y.: Multi-stage stochastic gradient method with momentum acceleration. Signal Process. 188, 108201 (2021)","journal-title":"Signal Process."},{"key":"2157_CR17","series-title":"Mathematical Statistics for Economics and Business","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-5022-1_6","volume-title":"Sampling, Sample Moments and Sampling Distributions","author":"RC Mittelhammer","year":"2013","unstructured":"Mittelhammer, R.C.: Sampling, Sample Moments and Sampling Distributions. Mathematical Statistics for Economics and Business, Springer, New York (2013)"},{"issue":"4","key":"2157_CR18","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4), 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"2157_CR19","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate. Sov. Math. Dokl. 27, 372\u2013376 (1983)","journal-title":"Sov. Math. Dokl."},{"key":"2157_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Springer, Boston (2004)"},{"key":"2157_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on Convex Optimization","author":"Y Nesterov","year":"2018","unstructured":"Nesterov, Y.: Lectures on Convex Optimization, vol. 137. Springer, Berlin (2018)"},{"key":"2157_CR22","unstructured":"Nguyen, L.M., Liu, J., Scheinberg, K., Taka, M.: SARAH: a novel method for machine learning problems using stochastic recursive gradient. In: Doina, P., Yee Whye, T. (eds.) The 34th International Conference on Machine Learning, vol. 70, pp. 2613\u20132621 (2017)"},{"issue":"1","key":"2157_CR23","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1080\/10556788.2020.1818081","volume":"36","author":"LM Nguyen","year":"2021","unstructured":"Nguyen, L.M., Scheinberg, K., Takac, M.: Inexact SARAH algorithm for stochastic optimization. Optim. Method Softw. 36(1), 237\u2013258 (2021)","journal-title":"Optim. Method Softw."},{"key":"2157_CR24","unstructured":"Nitanda, A.: Stochastic proximal gradient descent with acceleration techniques. In: Ghahramani, Z., Welling, M., Cortes, C., Lawrence, N., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 27, pp. 1574\u20131582 (2014)"},{"key":"2157_CR25","first-page":"1","volume":"21","author":"NH Pham","year":"2020","unstructured":"Pham, N.H., Nguyen, L.M., Phan, D.T., Tran-Dinh, Q.: ProxSARAH: an efficient algorithmic framework for stochastic composite nonconvex optimization. J. Mach. Learn. Res. 21, 1\u201348 (2020)","journal-title":"J. Mach. Learn. Res."},{"key":"2157_CR26","doi-asserted-by":"crossref","unstructured":"Reddi, S.J., Sra, S., Poczos, B., Smola, A.: Fast incremental method for nonconvex optimization. arXiv:1603.06159v1 (2016)","DOI":"10.1109\/CDC.2016.7798553"},{"issue":"3","key":"2157_CR27","first-page":"400","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. 22(3), 400\u2013407 (1951)","journal-title":"Ann. Math."},{"key":"2157_CR28","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz, S., Zhang, T.: Stochastic dual coordinate ascent methods for regularized loss minimization. arXiv:1209.1873v2 (2013)","DOI":"10.1007\/s10107-014-0839-0"},{"key":"2157_CR29","unstructured":"Shang, F., Jiao, L., Zhou, K., Cheng, J., Ren, Y., Jin, Y.: ASVRG: accelerated proximal SVRG. In: Zhu, J., Takeuchi, I. (eds.) Proceedings of Machine Learning Research, vol. 95, pp. 1\u201332 (2018)"},{"issue":"2","key":"2157_CR30","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/BF02190104","volume":"91","author":"A Shapiro","year":"1996","unstructured":"Shapiro, A., Wardi, Y.: Convergence analysis of gradient descent stochastic algorithms. J. Optim. Theory Appl. 91(2), 439\u2013454 (1996)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"2157_CR31","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1287\/moor.21.3.615","volume":"21","author":"A Shapiro","year":"1996","unstructured":"Shapiro, A., Wardi, Y.: Convergence analysis of stochastic algorithms. Math. Oper. Res. 21(3), 615\u2013628 (1996)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"2157_CR32","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10589-019-00073-1","volume":"73","author":"Z Wu","year":"2019","unstructured":"Wu, Z., Li, M.: General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems. Comput. Optim. Appl. 73(1), 129\u2013158 (2019)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"2157_CR33","doi-asserted-by":"publisher","first-page":"2057","DOI":"10.1137\/140961791","volume":"24","author":"L Xiao","year":"2014","unstructured":"Xiao, L., Zhang, T.: A proximal stochastic gradient method with progressive variance reduction. SIAM J. Optim. 24(4), 2057\u20132075 (2014)","journal-title":"SIAM J. Optim."},{"key":"2157_CR34","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.sigpro.2019.02.010","volume":"159","author":"Z Yang","year":"2019","unstructured":"Yang, Z., Wang, C., Zhang, Z., Li, J.: Accelerated stochastic gradient descent with step size selection rules. Signal Process. 159, 171\u2013186 (2019)","journal-title":"Signal Process."},{"key":"2157_CR35","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/BF01128757","volume":"4","author":"SK Zavriev","year":"1993","unstructured":"Zavriev, S.K., Kostyuk, F.V.: Heavy-ball method in nonconvex optimization problems. Comput. Math. Model. 4, 336\u2013341 (1993). https:\/\/doi.org\/10.1007\/BF01128757","journal-title":"Comput. Math. Model."},{"key":"2157_CR36","unstructured":"Zhou, K., Shang, F., Cheng, J.: A simple stochastic variance reduced algorithm with fast convergence rates. In: Jennifer, D., Andreas, K. (eds.) Proceedings of the 35th International Conference on Machine Learning, vol. 80, pp. 5980\u20135989 (2018)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02157-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-022-02157-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02157-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T03:02:56Z","timestamp":1679886176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-022-02157-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,12]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["2157"],"URL":"https:\/\/doi.org\/10.1007\/s10957-022-02157-1","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,12]]},"assertion":[{"value":"31 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}