{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T13:27:05Z","timestamp":1775136425284,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012597","name":"Scientific Startup Foundation for Doctors of Northwest A and F University","doi-asserted-by":"publisher","award":["Z1090324139"],"award-info":[{"award-number":["Z1090324139"]}],"id":[{"id":"10.13039\/501100012597","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s00186-026-00916-8","type":"journal-article","created":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T15:38:55Z","timestamp":1771256335000},"page":"469-489","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A unified mini-batch stochastic accelerated method for nonconvex stochastic programming"],"prefix":"10.1007","volume":"102","author":[{"given":"Ruyu","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quanwei","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,16]]},"reference":[{"issue":"3","key":"916_CR1","doi-asserted-by":"publisher","first-page":"1854","DOI":"10.1007\/s10915-019-00915-4","volume":"79","author":"S Ghadimi","year":"2019","unstructured":"Ghadimi S, Lan G, Zhang H (2019) Generalized uniformly optimal methods for nonlinear programming. J Sci Comput 79(3):1854\u20131881","journal-title":"J Sci Comput"},{"issue":"1","key":"916_CR2","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 (2016) Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math Program 156(1):59\u201399","journal-title":"Math Program"},{"issue":"4","key":"916_CR3","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1137\/110848864","volume":"22","author":"S Ghadimi","year":"2012","unstructured":"Ghadimi S, Lan G (2012) Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization I: A generic algorithmic framework. SIAM J Optim 22(4):1469\u20131492","journal-title":"SIAM J Optim"},{"key":"916_CR4","doi-asserted-by":"crossref","unstructured":"Robbins H, Monro S (1951) A stochastic approximation method. Ann. Math. Statist., 400\u2013407","DOI":"10.1214\/aoms\/1177729586"},{"key":"916_CR5","first-page":"98","volume":"7","author":"BT Polyak","year":"1990","unstructured":"Polyak BT (1990) New stochastic approximation type procedures. Automat I Telemekh 7:98\u2013107","journal-title":"Automat I Telemekh"},{"issue":"4","key":"916_CR6","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0330046","volume":"30","author":"BT Polyak","year":"1992","unstructured":"Polyak BT, Juditsky AB (1992) Acceleration of stochastic approximation by averaging. SIAM J Control Optim 30(4):838\u2013855","journal-title":"SIAM J Control Optim"},{"issue":"4","key":"916_CR7","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 (2009) Robust stochastic approximation approach to stochastic programming. SIAM J Optim 19(4):1574\u20131609","journal-title":"SIAM J Optim"},{"issue":"1","key":"916_CR8","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10107-010-0434-y","volume":"133","author":"G Lan","year":"2012","unstructured":"Lan G (2012) An optimal method for stochastic composite optimization. Math Program 133(1):365\u2013397","journal-title":"Math Program"},{"issue":"2","key":"916_CR9","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1287\/opre.2023.0055","volume":"73","author":"J Hu","year":"2025","unstructured":"Hu J, Fu MC (2025) On the convergence rate of stochastic approximation for gradient-based stochastic optimization. Oper Res 73(2):1143\u20131150","journal-title":"Oper Res"},{"key":"916_CR10","unstructured":"Adibi A, Dal Fabbro N, Schenato L, Kulkarni S, Poor HV, Pappas GJ, Hassani H, Mitra A (2024) Stochastic approximation with delayed updates: Finite-time rates under markovian sampling. In: International Conference on Artificial Intelligence and Statistics, pp. 2746\u20132754. PMLR"},{"key":"916_CR11","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov Y (1983) A method for unconstrained convex minimization problem with the rate of convergence O$$(1\/k^{2})$$. Doklady an ussr 269:543\u2013547","journal-title":"Doklady an ussr"},{"issue":"4","key":"916_CR12","doi-asserted-by":"publisher","first-page":"2753","DOI":"10.1137\/18M1192536","volume":"29","author":"G Lan","year":"2019","unstructured":"Lan G, Yang Y (2019) Accelerated stochastic algorithms for nonconvex finite-sum and multiblock optimization. SIAM J Optim 29(4):2753\u20132784","journal-title":"SIAM J Optim"},{"key":"916_CR13","doi-asserted-by":"publisher","first-page":"448","DOI":"10.4208\/csiam-am.SO-2021-0021","volume":"3","author":"J Bai","year":"2022","unstructured":"Bai J, Han D, Sun H, Zhang H (2022) Convergence on a symmetric accelerated stochastic ADMM with larger stepsizes. CSIAM Trans Appl Math 3:448\u2013479","journal-title":"CSIAM Trans Appl Math"},{"issue":"4","key":"916_CR14","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1287\/stsy.2022.0095","volume":"12","author":"A Jalilzadeh","year":"2022","unstructured":"Jalilzadeh A, Shanbhag U, Blanchet J, Glynn PW (2022) Smoothed variable sample-size accelerated proximal methods for nonsmooth stochastic convex programs. Stoch Syst 12(4):373\u2013410","journal-title":"Stoch Syst"},{"issue":"2","key":"916_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10915-022-02016-1","volume":"93","author":"R Wang","year":"2022","unstructured":"Wang R, Zhang C, Wang L, Shao Y (2022) A stochastic Nesterov\u2019s smoothing accelerated method for general nonsmooth constrained stochastic composite convex optimization. J Sci Comput 93(2):1\u201335","journal-title":"J Sci Comput"},{"key":"916_CR16","doi-asserted-by":"crossref","unstructured":"Yazdandoost Hamedani E, Jalilzadeh A (2023) A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems. Comput. Optim. Appl., 1\u201327","DOI":"10.1007\/s10589-023-00472-5"},{"issue":"3","key":"916_CR17","doi-asserted-by":"publisher","first-page":"2386","DOI":"10.1109\/TETCI.2024.3360338","volume":"8","author":"M Chen","year":"2024","unstructured":"Chen M, Wang R, Qiao Y, Luo X (2024) A generalized nesterov\u2019s accelerated gradient-incorporated non-negative latent-factorization-of-tensors model for efficient representation to dynamic qos data. IEEE Transactions on Emerging Topics in Computational Intelligence 8(3):2386\u20132400","journal-title":"IEEE Transactions on Emerging Topics in Computational Intelligence"},{"issue":"1","key":"916_CR18","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","volume":"152","author":"Y Nesterov","year":"2015","unstructured":"Nesterov Y (2015) Universal gradient methods for convex optimization problems. Math Program 152(1):381\u2013404","journal-title":"Math Program"},{"issue":"3","key":"916_CR19","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/s10915-025-02802-7","volume":"102","author":"J Bai","year":"2025","unstructured":"Bai J, Chen Y, Yu X, Zhang H (2025) Generalized asymmetric forward-backward-adjoint algorithms for convex-concave saddle-point problem. J Sci Comput 102(3):80","journal-title":"J Sci Comput"},{"issue":"4","key":"916_CR20","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/s40305-023-00470-8","volume":"11","author":"J-C Bai","year":"2023","unstructured":"Bai J-C, Bian F-M, Chang X-K, Du L (2023) Accelerated stochastic peaceman-rachford method for empirical risk minimization. Journal of the Operations Research Society of China 11(4):783\u2013807","journal-title":"Journal of the Operations Research Society of China"},{"key":"916_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2024.111554","volume":"163","author":"Y Zeng","year":"2024","unstructured":"Zeng Y, Wang Z, Bai J, Shen X (2024) An accelerated stochastic admm for nonconvex and nonsmooth finite-sum optimization. Automatica 163:111554","journal-title":"Automatica"},{"key":"916_CR22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck A (2017) First-order Methods in Optimization. SIAM, Philadelphia"},{"issue":"1","key":"916_CR23","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10107-014-0846-1","volume":"155","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi S, Lan G, Zhang H (2016) Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization. Math Program 155(1):267\u2013305","journal-title":"Math Program"},{"key":"916_CR24","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2013","unstructured":"Nesterov Y (2013) Introductory Lectures on Convex Optimization: A Basic Course, vol 87. Springer, New York"},{"key":"916_CR25","first-page":"512","volume":"12","author":"L Mason","year":"1999","unstructured":"Mason L, Baxter J, Bartlett P, Frean M (1999) Boosting algorithms as gradient descent. Adv Neural Inf Process Syst 12:512\u2013518","journal-title":"Adv Neural Inf Process Syst"},{"issue":"2","key":"916_CR26","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1137\/110831659","volume":"22","author":"JC Duchi","year":"2012","unstructured":"Duchi JC, Bartlett PL, Wainwright MJ (2012) Randomized smoothing for stochastic optimization. SIAM J Optim 22(2):674\u2013701","journal-title":"SIAM J Optim"},{"issue":"2","key":"916_CR27","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1137\/070702187","volume":"20","author":"C Zhang","year":"2009","unstructured":"Zhang C, Chen X (2009) Smoothing projected gradient method and its application to stochastic linear complementarity problems. SIAM J Optim 20(2):627\u2013649","journal-title":"SIAM J Optim"},{"issue":"1","key":"916_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/18M119611X","volume":"30","author":"C Zhang","year":"2020","unstructured":"Zhang C, Chen X (2020) A smoothing active set method for linearly constrained non-Lipschitz nonconvex optimization. SIAM J Optim 30(1):1\u201330","journal-title":"SIAM J Optim"},{"issue":"2","key":"916_CR29","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10589-021-00338-8","volume":"81","author":"J Bai","year":"2022","unstructured":"Bai J, Hager WW, Zhang H (2022) An inexact accelerated stochastic ADMM for separable convex optimization. Comput Optim Appl 81(2):479\u2013518","journal-title":"Comput Optim Appl"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-026-00916-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00186-026-00916-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-026-00916-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T12:42:34Z","timestamp":1775133754000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00186-026-00916-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":29,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["916"],"URL":"https:\/\/doi.org\/10.1007\/s00186-026-00916-8","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12]]},"assertion":[{"value":"2 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}