{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T23:28:20Z","timestamp":1780356500525,"version":"3.54.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T00:00:00Z","timestamp":1675814400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T00:00:00Z","timestamp":1675814400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11601183"],"award-info":[{"award-number":["11601183"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11701210"],"award-info":[{"award-number":["11701210"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011789","name":"Department of Science and Technology of Jilin Province","doi-asserted-by":"publisher","award":["20190103029JH,20200201269JC"],"award-info":[{"award-number":["20190103029JH,20200201269JC"]}],"id":[{"id":"10.13039\/501100011789","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010211","name":"Education Department of Jilin Province","doi-asserted-by":"publisher","award":["JJKH20211031KJ"],"award-info":[{"award-number":["JJKH20211031KJ"]}],"id":[{"id":"10.13039\/501100010211","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013385","name":"National Science and Technology Program of China","doi-asserted-by":"crossref","award":["2020YFA0714100"],"award-info":[{"award-number":["2020YFA0714100"]}],"id":[{"id":"10.13039\/501100013385","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100013385","name":"National Science and Technology Program of China","doi-asserted-by":"crossref","award":["61872162, 12171199"],"award-info":[{"award-number":["61872162, 12171199"]}],"id":[{"id":"10.13039\/501100013385","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012476","name":"Fundamental Research Funds for Central Universities of the Central South University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012476","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011789","name":"Department of Science and Technology of Jilin Province","doi-asserted-by":"publisher","award":["20180520212JH"],"award-info":[{"award-number":["20180520212JH"]}],"id":[{"id":"10.13039\/501100011789","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011789","name":"Department of Science and Technology of Jilin Province","doi-asserted-by":"publisher","award":["20210201015GX"],"award-info":[{"award-number":["20210201015GX"]}],"id":[{"id":"10.13039\/501100011789","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10915-023-02110-y","type":"journal-article","created":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T07:35:30Z","timestamp":1675841730000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Block Mirror Stochastic Gradient Method For Stochastic Optimization"],"prefix":"10.1007","volume":"94","author":[{"given":"Jinda","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haiming","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6392-701X","authenticated-orcid":false,"given":"Xinxin","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Di","family":"Hou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,2,8]]},"reference":[{"key":"2110_CR1","first-page":"8194","volume":"18","author":"Z Allen-Zhu","year":"2017","unstructured":"Allen-Zhu, Z.: Katyusha: the first direct acceleration of stochastic gradient methods. J. Mach. Learn. Res. 18, 8194\u20138244 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"2110_CR2","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"LM Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming. Comput. Math. Math. Phys. 7, 200\u2013217 (1967)","journal-title":"Comput. Math. Math. Phys."},{"key":"2110_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A Beck","year":"2003","unstructured":"Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31, 167\u2013175 (2003)","journal-title":"Oper. Res. Lett."},{"key":"2110_CR4","doi-asserted-by":"crossref","unstructured":"Beck, A.: First-Order Methods in Optimization. Society for Industrial and Applied Mathematics (2017)","DOI":"10.1137\/1.9781611974997"},{"key":"2110_CR5","doi-asserted-by":"crossref","unstructured":"Buza, K.: Feedback prediction for blogs. In: Data Analysis, Machine Learning and Knowledge Discovery, pp. 145\u2013152. Springer (2014)","DOI":"10.1007\/978-3-319-01595-8_16"},{"key":"2110_CR6","first-page":"1646","volume":"2","author":"A Defazio","year":"2014","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: SAGA: a fast incremental gradient method with support for non-strongly convex composite objectives. Adv. Neural Inf. Process. Syst. 2, 1646\u20131654 (2014)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"2110_CR7","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1137\/130936361","volume":"25","author":"CD Dang","year":"2015","unstructured":"Dang, C.D., Lan, G.: Stochastic block mirror descent methods for nonsmooth and stochastic optimization. SIAM J. Optim. 25, 856\u2013881 (2015)","journal-title":"SIAM J. Optim."},{"key":"2110_CR8","doi-asserted-by":"crossref","unstructured":"Fu, M: Optimization for simulation: theory vs. practice. INFORMS J. Comput. 14, 192\u2013215 (2002)","DOI":"10.1287\/ijoc.14.3.192.113"},{"key":"2110_CR9","doi-asserted-by":"publisher","first-page":"A1380","DOI":"10.1137\/110830629","volume":"34","author":"MP Friedlander","year":"2012","unstructured":"Friedlander, M.P., Schmidt, M.: Hybrid deterministic-stochastic methods for data fitting. SIAM J. Sci. Comput. 34, A1380\u2013A1405 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"2110_CR10","volume-title":"Gradient Estimation via Perturbation Analysis","author":"P Glasserman","year":"2003","unstructured":"Glasserman, P.: Gradient Estimation via Perturbation Analysis. Kluwer, Boston (2003)"},{"key":"2110_CR11","doi-asserted-by":"crossref","unstructured":"Gemulla, R., Nijkamp, E., Haas, P.J., Sismanis, Y.: Large-scale matrix factorization with distributed stochastic gradient descent. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 69\u201377 (2011)","DOI":"10.1145\/2020408.2020426"},{"key":"2110_CR12","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":"2110_CR13","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":"2110_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/nav.3800040113","volume":"4","author":"C Hildreth","year":"1957","unstructured":"Hildreth, C.: A quadratic programming procedure. Nav. Res. Logist. Q. 4, 79\u201385 (1957)","journal-title":"Nav. Res. Logist. Q."},{"issue":"9","key":"2110_CR15","first-page":"121","volume":"30","author":"A Juditsky","year":"2011","unstructured":"Juditsky, A., Nemirovski, A.S.: First order methods for nonsmooth convex large-scale optimization, I: general purpose methods. Optim. Mach. Learn. 30(9), 121\u2013148 (2011)","journal-title":"Optim. Mach. Learn."},{"key":"2110_CR16","doi-asserted-by":"publisher","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, 365\u2013397 (2012)","journal-title":"Math. Program."},{"key":"2110_CR17","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."},{"key":"2110_CR18","doi-asserted-by":"crossref","unstructured":"Lan, G.: First-Order and Stochastic Optimization Methods for Machine Learning. Springer (2020)","DOI":"10.1007\/978-3-030-39568-1"},{"key":"2110_CR19","first-page":"3384","volume":"2","author":"H Lin","year":"2015","unstructured":"Lin, H., Mairal, J., Harchaoui, Z.: A universal catalyst for first-order optimization. Adv. Neural Inf. Process. Syst. 2, 3384\u20133392 (2015)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"2110_CR20","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10479-006-6169-8","volume":"142","author":"J Linderoth","year":"2006","unstructured":"Linderoth, J., Shapiro, A., Wright, S.: The empirical behavior of sampling methods for stochastic programming. Ann. Oper. Res. 142, 215\u2013241 (2006)","journal-title":"Ann. Oper. Res."},{"key":"2110_CR21","unstructured":"Lu. Z., Xiao. L.: Randomized block coordinate non-monotone gradient method for a class of nonlinear programming. arXiv preprint. arXiv:1306.5918 (2013)"},{"key":"2110_CR22","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"AS Nemirovski","year":"1983","unstructured":"Nemirovski, A.S., Yudin, D.B.: Problem Complexity and Method Efficiency in Optimization. Wiley, New York (1983)"},{"key":"2110_CR23","doi-asserted-by":"publisher","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. A. SIAM J. Optim. 19, 1574\u20131609 (2009)","journal-title":"A. SIAM J. Optim."},{"key":"2110_CR24","unstructured":"Nguyen, L.M., Liu, J., Scheinberg, K., Tak\u00e1\u010d. M.: SARAH: a novel method for machine learning problems using stochastic recursive gradient. In: Proceedings of the 34th International Conference on Machine Learning, pp. 2613\u20132621 (2017)"},{"key":"2110_CR25","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. Kluwer, Boston (2004)"},{"key":"2110_CR26","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22, 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"key":"2110_CR27","unstructured":"Pham, N.H., Nguyen, L.M., Phan, D.T., Tran-Dinh, Q.: ProxSARAH: an efficient algorithmic framework for stochastic composite nonconvex optimization. arXiv preprint, arXiv:1902.05679 (2019)"},{"key":"2110_CR28","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s12532-013-0053-8","volume":"5","author":"B Recht","year":"2013","unstructured":"Recht, B., R\u00e9, C.: Parallel stochastic gradient algorithms for large-scale matrix completion. Math. Program. Comput. 5, 201\u2013226 (2013)","journal-title":"Math. Program. Comput."},{"key":"2110_CR29","doi-asserted-by":"publisher","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":"2110_CR30","doi-asserted-by":"crossref","unstructured":"Rockafellar, R., Wets, J.: Variational Analysis. Springer, Berlin (1998)","DOI":"10.1007\/978-3-642-02431-3"},{"key":"2110_CR31","unstructured":"Rubinstein, R.Y., Shapiro, A.: Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization by the Score Function Method. Wiley (1993)"},{"key":"2110_CR32","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/0-387-26771-9_4","volume-title":"Continuous Optimization: Current Trends and Applications","author":"A Shapiro","year":"2005","unstructured":"Shapiro, A., Nemirovski, A.: On complexity of stochastic programming problems. In: Jeyakumar, V., Rubinov, A.M. (eds.) Continuous Optimization: Current Trends and Applications, pp. 111\u2013144. Springer, New York (2005)"},{"key":"2110_CR33","unstructured":"Sospedra, J.T., Montoliu, R., et al.: UJIIndoorLoc: a new multi-building and multi-floor database for WLAN fingerprint-based indoor localization problems. In: Proceedings of the Fifth International Conference on Indoor Positioning and Indoor Navigation (2014)"},{"key":"2110_CR34","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10107-016-1030-6","volume":"162","author":"M Schmidt","year":"2017","unstructured":"Schmidt, M., Roux, N.L., Bach, F.: Minimizing finite sums with the stochastic average gradient. Math. Program. 162, 83\u2013112 (2017)","journal-title":"Math. Program."},{"key":"2110_CR35","first-page":"567","volume":"14","author":"S Shalev-Shwartz","year":"2013","unstructured":"Shalev-Shwartz, S., Zhang, T.: Stochastic dual coordinate ascent methods for regularized loss minimization. J. Mach. Learn. Res. 14, 567\u2013599 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"2110_CR36","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10107-014-0839-0","volume":"155","author":"S Shalev-Shwartz","year":"2016","unstructured":"Shalev-Shwartz, S., Zhang, T.: Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization. Math. Program. 155, 105\u2013145 (2016)","journal-title":"Math. Program."},{"key":"2110_CR37","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz, S., Singer, Y., Srebro, N., Cotter. A.: Pegasos: primal estimated sub-gradient solver for SVM. Math. Program. 127, 3\u201330 (2011)","DOI":"10.1007\/s10107-010-0420-4"},{"key":"2110_CR38","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10107-019-01437-5","volume":"185","author":"R Sun","year":"2021","unstructured":"Sun, R., Ye, Y.: Worst-case complexity of cyclic coordinate descent: $$O (n^2)$$ gap with randomized version. Math. Program. 185, 487\u2013520 (2021)","journal-title":"Math. Program."},{"key":"2110_CR39","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P Tseng","year":"2009","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117, 387\u2013423 (2009)","journal-title":"Math. Program."},{"key":"2110_CR40","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1021814225969","volume":"24","author":"B Verweij","year":"2003","unstructured":"Verweij, B., Ahmed, S., Kleywegt, A.J., Nemhauser, G., Shapiro, A.: The sample average approximation method applied to stochastic routing problems: a computational study. Comput. Optim. Appl. 24, 289\u2013333 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"2110_CR41","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, 2057\u20132075 (2014)","journal-title":"SIAM J. Optim."},{"key":"2110_CR42","doi-asserted-by":"publisher","first-page":"1686","DOI":"10.1137\/140983938","volume":"25","author":"Y Xu","year":"2015","unstructured":"Xu, Y., Yin, W.: Block stochastic gradient iteration for convex and nonconvex optimization. SIAM J. Optim. 25, 1686\u20131716 (2015)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02110-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-023-02110-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02110-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T21:14:21Z","timestamp":1677100461000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-023-02110-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,8]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["2110"],"URL":"https:\/\/doi.org\/10.1007\/s10915-023-02110-y","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,8]]},"assertion":[{"value":"16 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All the authors declare they have no financial interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"69"}}