{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T06:36:20Z","timestamp":1773815780524,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,2,17]],"date-time":"2021-02-17T00:00:00Z","timestamp":1613520000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,17]],"date-time":"2021-02-17T00:00:00Z","timestamp":1613520000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671116"],"award-info":[{"award-number":["11671116"]}],"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":["11271107"],"award-info":[{"award-number":["11271107"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010905","name":"Major Research Plan","doi-asserted-by":"publisher","award":["91630202"],"award-info":[{"award-number":["91630202"]}],"id":[{"id":"10.13039\/501100010905","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":[[2021,4]]},"DOI":"10.1007\/s10915-020-01402-x","type":"journal-article","created":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T07:08:45Z","timestamp":1613718525000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Stochastic Variance Reduced Gradient Methods Using a Trust-Region-Like Scheme"],"prefix":"10.1007","volume":"87","author":[{"given":"Tengteng","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9829-3395","authenticated-orcid":false,"given":"Xin-Wei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Hong","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,17]]},"reference":[{"key":"1402_CR1","doi-asserted-by":"crossref","unstructured":"Allen-Zhu, Z.: Katyusha: The first direct acceleration of stochastic gradient methods. In: Proc. 49th Annu. SIGACT STOC, pp. 1200\u20131205 (2017)","DOI":"10.1145\/3055399.3055448"},{"key":"1402_CR2","unstructured":"Allen-Zhu, Z., Hazan, E.: Optimal black-box reductions between optimization objectives. In: Proc. 29th Int. Conf. Adv. Neural Inf. Process. Syst., pp. 1614\u20131622 (2016)"},{"key":"1402_CR3","unstructured":"Allen-Zhu, Z., Yuan, Y.: Improved SVRG for non-strongly-convex or sum-of-non-convex objectives. In: Int. Conf. Mach. Learn., pp. 1080\u20131089 (2016)"},{"issue":"1","key":"1402_CR4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"issue":"9","key":"1402_CR5","doi-asserted-by":"publisher","first-page":"2217","DOI":"10.1109\/TAC.2013.2254619","volume":"58","author":"S Bonnabel","year":"2013","unstructured":"Bonnabel, S.: Stochastic gradient descent on Riemannian manifolds. IEEE Trans. Autom. Control 58(9), 2217\u20132229 (2013)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1402_CR6","doi-asserted-by":"crossref","unstructured":"Bottou, L.: Large-scale machine learning with stochastic gradient descent. In: Proc. COMPSTAT\u20192010, pp. 177\u2013186. Springer (2010)","DOI":"10.1007\/978-3-7908-2604-3_16"},{"issue":"2","key":"1402_CR7","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"issue":"12","key":"1402_CR8","doi-asserted-by":"publisher","first-page":"3017","DOI":"10.1109\/78.553476","volume":"44","author":"JF Cardoso","year":"1996","unstructured":"Cardoso, J.F., Laheld, B.H.: Equivariant adaptive source separation. IEEE Trans. Signal Process. 44(12), 3017\u20133030 (1996)","journal-title":"IEEE Trans. Signal Process."},{"key":"1402_CR9","doi-asserted-by":"crossref","unstructured":"Chang, D., Lin, M., Zhang, C.: On the generalization ability of online gradient descent algorithm under the quadratic growth condition. IEEE Trans. Neural Netw. Learn. Syst. (2018)","DOI":"10.1109\/TNNLS.2017.2764960"},{"key":"1402_CR10","unstructured":"Chen, Z., Xu, Y., Chen, E., Yang, T.: Sadagrad: strongly adaptive stochastic gradient methods. In: Int. Conf. Mach. Learn., pp. 912\u2013920 (2018)"},{"issue":"11","key":"1402_CR11","doi-asserted-by":"publisher","first-page":"5974","DOI":"10.1109\/TAC.2017.2705559","volume":"62","author":"K Cohen","year":"2017","unstructured":"Cohen, K., Nedi\u0107, A., Srikant, R.: On projected stochastic gradient descent algorithm with weighted averaging for least squares regression. IEEE Trans. Autom. Control 62(11), 5974\u20135981 (2017)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1402_CR12","unstructured":"Curtis, F.E., Scheinberg, K., Shi, R.: A stochastic trust region algorithm. arXiv preprint arXiv:1712.10277 (2017)"},{"key":"1402_CR13","doi-asserted-by":"crossref","unstructured":"Dai, Y.H., Al-Baali, M., Yang, X.: A positive Barzilai\u2013Borwein-like stepsize and an extension for symmetric linear systems. In: Numer. Funct. Anal. Optim., pp. 59\u201375. Springer (2015)","DOI":"10.1007\/978-3-319-17689-5_3"},{"issue":"1","key":"1402_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00211-004-0569-y","volume":"100","author":"YH Dai","year":"2005","unstructured":"Dai, Y.H., Fletcher, R.: Projected Barzilai\u2013Borwein methods for large-scale box-constrained quadratic programming. Numer. Math. 100(1), 21\u201347 (2005)","journal-title":"Numer. Math."},{"key":"1402_CR15","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: Saga: a fast incremental gradient method with support for non-strongly convex composite objectives. In: Proc. 27th Int. Conf. Adv. Neural Inf. Process. Syst., pp. 1646\u20131654 (2014)"},{"key":"1402_CR16","unstructured":"Frostig, R., Ge, R., Kakade, S., Sidford, A.: Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization. In: Int. Conf. Mach. Learn., pp. 2540\u20132548 (2015)"},{"issue":"11","key":"1402_CR17","doi-asserted-by":"publisher","first-page":"1867","DOI":"10.1109\/TCOM.1980.1094608","volume":"28","author":"D Godard","year":"1980","unstructured":"Godard, D.: Self-recovering equalization and carrier tracking in two-dimensional data communication systems. IEEE Trans. Commun. 28(11), 1867\u20131875 (1980)","journal-title":"IEEE Trans. Commun."},{"key":"1402_CR18","unstructured":"Harikandeh, R., Ahmed, M.O., Virani, A., Schmidt, M., Kone\u010dn\u1ef3, J., Sallinen, S.: Stopwasting my gradients: practical SVRG. In: Proc. 28th Int. Conf. Adv. Neural Inf. Process. Syst., pp. 2251\u20132259 (2015)"},{"issue":"3","key":"1402_CR19","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s10589-016-9854-9","volume":"65","author":"Y Huang","year":"2016","unstructured":"Huang, Y., Liu, H.: Smoothing projected Barzilai\u2013Borwein method for constrained non-Lipschitz optimization. Comput. Optim. Appl. 65(3), 671\u2013698 (2016)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"1402_CR20","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s11075-013-9803-y","volume":"67","author":"Y Huang","year":"2014","unstructured":"Huang, Y., Liu, H., Zhou, S.: A Barzilai\u2013Borwein type method for stochastic linear complementarity problems. Numer. Algorithm 67(3), 477\u2013489 (2014)","journal-title":"Numer. Algorithm"},{"issue":"6","key":"1402_CR21","doi-asserted-by":"publisher","first-page":"1665","DOI":"10.1007\/s10618-014-0390-x","volume":"29","author":"Y Huang","year":"2015","unstructured":"Huang, Y., Liu, H., Zhou, S.: Quadratic regularization projected Barzilai\u2013Borwein method for nonnegative matrix factorization. Data Min. Knowl. Disc. 29(6), 1665\u20131684 (2015)","journal-title":"Data Min. Knowl. Disc."},{"key":"1402_CR22","unstructured":"Jiang, B., Ma, S., So, A.M.C., Zhang, S.: Vector transport-free SVRG with general retraction for riemannian optimization: complexity analysis and practical implementation. arXiv preprint arXiv:1705.09059 (2017)"},{"key":"1402_CR23","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. In: Proc. 26th Int. Conf. Adv. Neural Inf. Process. Syst., pp. 315\u2013323 (2013)"},{"issue":"2","key":"1402_CR24","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1109\/JSTSP.2015.2505682","volume":"10","author":"J Kone\u010dn\u1ef3","year":"2016","unstructured":"Kone\u010dn\u1ef3, J., Liu, J., Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Mini-batch semi-stochastic gradient descent in the proximal setting. IEEE J. Sel. Top. Signal Process. 10(2), 242\u2013255 (2016)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"1402_CR25","doi-asserted-by":"publisher","first-page":"9","DOI":"10.3389\/fams.2017.00009","volume":"3","author":"J Kone\u010dn\u1ef3","year":"2017","unstructured":"Kone\u010dn\u1ef3, J., Richt\u00e1rik, P.: Semi-stochastic gradient descent methods. Front. Appl. Math. Stat. 3, 9 (2017)","journal-title":"Front. Appl. Math. Stat."},{"key":"1402_CR26","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.sigpro.2017.03.025","volume":"139","author":"T Kronvall","year":"2017","unstructured":"Kronvall, T., Adalbj\u00f6rnsson, S.I., Nadig, S., Jakobsson, A.: Group-sparse regression using the covariance fitting criterion. Signal Process. 139, 116\u2013130 (2017)","journal-title":"Signal Process."},{"issue":"5","key":"1402_CR27","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1109\/TNNLS.2017.2672978","volume":"29","author":"XL Li","year":"2018","unstructured":"Li, X.L.: Preconditioned stochastic gradient descent. IEEE Trans. Neural Netw. Learn. Syst. 29(5), 1454\u20131466 (2018)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"2","key":"1402_CR28","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1137\/140957639","volume":"25","author":"J Mairal","year":"2015","unstructured":"Mairal, J.: Incremental majorization-minimization optimization with application to large-scale machine learning. SIAM J. Optim. 25(2), 829\u2013855 (2015)","journal-title":"SIAM J. Optim."},{"key":"1402_CR29","doi-asserted-by":"crossref","unstructured":"Mairal, J., Bach, F., Ponce, J., Sapiro, G.: Online dictionary learning for sparse coding. In: Proc. 26th Int. Conf. Mach. Learn., pp. 689\u2013696 (2009)","DOI":"10.1145\/1553374.1553463"},{"issue":"2","key":"1402_CR30","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1109\/TKDE.2016.2604302","volume":"29","author":"Y Mu","year":"2017","unstructured":"Mu, Y., Liu, W., Liu, X., Fan, W.: Stochastic gradient made stable: a manifold propagation approach for large-scale optimization. IEEE Trans. Knowl. Data Eng. 29(2), 458\u2013471 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1402_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Programming","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Programming, vol. 1. Springer Science, New York (2004)"},{"key":"1402_CR32","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: Int. Conf. Mach. Learn., pp. 2613\u20132621 (2017)"},{"key":"1402_CR33","unstructured":"Rakhlin, A., Shamir, O., Sridharan, K., et\u00a0al.: Making gradient descent optimal for strongly convex stochastic optimization. In: Int. Conf. Mach. Learn., pp. 1571\u20131578 (2012)"},{"key":"1402_CR34","doi-asserted-by":"crossref","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. pp. 400\u2013407 (1951)","DOI":"10.1214\/aoms\/1177729586"},{"key":"1402_CR35","unstructured":"Roux, N.L., Schmidt, M., Bach, F.R.: A stochastic gradient method with an exponential convergence rate for finite training sets. In: Proc. 25th Int. Conf. Adv. Neural Inf. Process. Syst., pp. 2663\u20132671 (2012)"},{"key":"1402_CR36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019","volume-title":"Understanding Machine Learning: From Theory to Algorithms","author":"S Shalev-Shwartz","year":"2014","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, Cambridge (2014)"},{"key":"1402_CR37","unstructured":"Sutskever, I., Martens, J., Dahl, G., Hinton, G.: On the importance of initialization and momentum in deep learning. In: Int. Conf. Mach. Learn., pp. 1139\u20131147 (2013)"},{"key":"1402_CR38","unstructured":"Tan, C., Ma, S., Dai, Y.H., Qian, Y.: Barzilai\u2013Borwein step size for stochastic gradient descent. In: Proc. 29th Int. Conf. Adv. Neural Inf. Process. Syst., pp. 685\u2013693 (2016)"},{"issue":"2","key":"1402_CR39","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/15M1053141","volume":"27","author":"X Wang","year":"2017","unstructured":"Wang, X., Ma, S., Goldfarb, D., Liu, W.: Stochastic quasi-Newton methods for nonconvex stochastic optimization. SIAM J. Optim. 27(2), 927\u2013956 (2017)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1402_CR40","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1137\/090747695","volume":"32","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Yin, W., Goldfarb, D., Zhang, Y.: A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation. SIAM J. Sci. Comput. 32(4), 1832\u20131857 (2010)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"1402_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(4), 2057\u20132075 (2014)","journal-title":"SIAM J. Optim."},{"key":"1402_CR42","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.neucom.2018.06.002","volume":"314","author":"Z Yang","year":"2018","unstructured":"Yang, Z., Wang, C., Zang, Y., Li, J.: Mini-batch algorithms with Barzilai\u2013Borwein update step. Neurocomputing 314, 177\u2013185 (2018)","journal-title":"Neurocomputing"},{"key":"1402_CR43","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."},{"issue":"1","key":"1402_CR44","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10107-015-0893-2","volume":"151","author":"Y-X Yuan","year":"2015","unstructured":"Yuan, Y.-X.: Recent advances in trust region algorithms. Math. Program. 151(1), 249\u2013281 (2015)","journal-title":"Math. Program."},{"key":"1402_CR45","unstructured":"Zhang, L., Mahdavi, M., Jin, R.: Linear convergence with condition number independent access of full gradients. In: Proc. 26th Int. Conf. Adv. Neural Inf. Process. Syst., pp. 980\u2013988 (2013)"},{"key":"1402_CR46","doi-asserted-by":"crossref","unstructured":"Zhang, T.: Solving large scale linear prediction problems using stochastic gradient descent algorithms. In: Int. Conf. Mach. Learn. (2004)","DOI":"10.1145\/1015330.1015332"},{"key":"1402_CR47","unstructured":"Zhao, P., Zhang, T.: Stochastic optimization with importance sampling for regularized loss minimization. In: Int. Conf. Mach. Learn., pp. 1\u20139 (2015)"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-020-01402-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10915-020-01402-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-020-01402-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T13:19:16Z","timestamp":1617023956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10915-020-01402-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,17]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["1402"],"URL":"https:\/\/doi.org\/10.1007\/s10915-020-01402-x","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,17]]},"assertion":[{"value":"25 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"5"}}