{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T06:48:20Z","timestamp":1778827700077,"version":"3.51.4"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T00:00:00Z","timestamp":1581897600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T00:00:00Z","timestamp":1581897600000},"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":["11731013"],"award-info":[{"award-number":["11731013"]}],"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":["11571014"],"award-info":[{"award-number":["11571014"]}],"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":["11731013"],"award-info":[{"award-number":["11731013"]}],"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":["11871453"],"award-info":[{"award-number":["11871453"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010097","name":"China Association for Science and Technology","doi-asserted-by":"publisher","award":["2018-2020"],"award-info":[{"award-number":["2018-2020"]}],"id":[{"id":"10.13039\/100010097","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s11590-020-01550-x","type":"journal-article","created":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T18:29:30Z","timestamp":1581964170000},"page":"2265-2283","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A linearly convergent stochastic recursive gradient method for convex optimization"],"prefix":"10.1007","volume":"14","author":[{"given":"Yan","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiande","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,17]]},"reference":[{"issue":"3","key":"1550_CR1","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(3), 400\u2013407 (1951)","journal-title":"Ann Math Stat"},{"key":"1550_CR2","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2014","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Springer, Boston (2014)"},{"issue":"2","key":"1550_CR3","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."},{"key":"1550_CR4","unstructured":"Roux, N.L., Schmidt, M., Bach, F.R.: A stochastic gradient method with an exponential convergence rate for finite training sets. In: Neural Information Processing Systems, pp. 2663\u20132671 (2013)"},{"issue":"1","key":"1550_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10107-016-1030-6","volume":"162","author":"MW Schmidt","year":"2017","unstructured":"Schmidt, M.W., Roux, N.L., Bach, F.: Minimizing finite sums with the stochastic average gradient. Math. Program. 162(1), 83\u2013112 (2017)","journal-title":"Math. Program."},{"key":"1550_CR6","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: SAGA: a fast incremental gradient method with support for non-strongly convex composite objectives. In: Neural Information Processing Systems, pp. 1646\u20131654 (2014)"},{"key":"1550_CR7","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. In: Neural Information Processing Systems, pp. 315\u2013323 (2013)"},{"key":"1550_CR8","unstructured":"Nguyen, L.M., Liu, J., Scheinberg, K., Takac, M.: SARAH: a novel method for machine learning problems using stochastic recursive gradient. In: Neural Information Processing Systems, pp. 2613\u20132621 (2017)"},{"key":"1550_CR9","unstructured":"Nguyen, L. M., Scheinberg, K, Tak\u00e1\u010d, M.: Inexact SARAH algorithm for stochastic optimization (2018). arXiv:1811.10105"},{"key":"1550_CR10","unstructured":"Nguyen, L.M., Scheinberg, K, Tak\u00e1\u010d, M.: Stochastic recursive gradient algorithm for nonconvex optimization (2017). arXiv:1705.07261"},{"key":"1550_CR11","unstructured":"Fang, C., Li, C. J., Lin, Z., Zhang, T.: Spider: near-optimal non-convex optimization via stochastic path-integrated differential estimator. In: Neural Information Processing Systems, pp. 687\u2013697 (2018)"},{"key":"1550_CR12","unstructured":"Wang, Z., Ji, K., Zhou, Y., Liang, Y., Tarokh, V.: SpiderBoost: a class of faster variance-reduced algorithms for nonconvex optimization (2018). arXiv:1810.10690"},{"key":"1550_CR13","unstructured":"Babanezhad, R., Ahmed, M.O., Virani, A., Schmidt, M.W., Konecn\u00fd, J., Sallinen, S.: Stop wasting my gradients: practical SVRG. In: Neural Information Processing Systems, pp. 2251\u20132259 (2015)"},{"key":"1550_CR14","doi-asserted-by":"publisher","first-page":"9","DOI":"10.3389\/fams.2017.00009","volume":"3","author":"J Konecn\u00fd","year":"2017","unstructured":"Konecn\u00fd, J., Richtarik, P.: Semi-stochastic gradient descent methods. Front. Appl. Math. Stat. 3, 9 (2017)","journal-title":"Front. Appl. Math. Stat."},{"key":"1550_CR15","unstructured":"Zhou, C., Gao, W., Goldfarb, D.: Stochastic adaptive quasi-Newton methods for minimizing expected values. In: International Conference on Machine Learning, pp. 4150\u20134159 (2017)"},{"key":"1550_CR16","first-page":"2121","volume":"12","author":"JC Duchi","year":"2011","unstructured":"Duchi, J.C., Hazan, E., Singer, Y.J.: Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res. 12, 2121\u20132159 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"1550_CR17","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. In: International Conference on Learning Representations, pp. 1\u201313 (2015)"},{"key":"1550_CR18","unstructured":"De, S., Yadav, A.K., Jacobs, D.W., Goldstein, T.: Automated inference with adaptive batches. In: International Conference on Artificial Intelligence and Statistics, pp. 1504\u20131513 (2017)"},{"key":"1550_CR19","unstructured":"Tan, C., Ma, S., Dai, Y.H., Qian, Y.: Barzilai\u2013Borwein step size for stochastic gradient descent. In: Neural Information Processing Systems, pp. 685\u2013693 (2016)"},{"key":"1550_CR20","unstructured":"Dai, Y.H., Huang, Y., Liu, X.W.: A family of spectral gradient methods for optimization (2018). arXiv:1812.02974"},{"issue":"1","key":"1550_CR21","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":"1","key":"1550_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/imanum\/22.1.1","volume":"22","author":"YH Dai","year":"2002","unstructured":"Dai, Y.H., Liao, L.Z.: R-linear convergence of the Barzilai and Borwein gradient method. IMA J. Numer. Anal. 22(1), 1\u201310 (2002)","journal-title":"IMA J. Numer. Anal."},{"key":"1550_CR23","doi-asserted-by":"crossref","unstructured":"Fletcher, R.: On the Barzilai\u2013Borwein method. Optimization and control with applications, pp. 235\u2013256 (2005)","DOI":"10.1007\/0-387-24255-4_10"},{"issue":"4","key":"1550_CR24","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":"1550_CR25","unstructured":"Zhao, P., Zhang, T.: Stochastic optimization with importance sampling for regularized loss minimization. In: International Conference on Machine Learning, pp. 1\u20139 (2015)"},{"issue":"4","key":"1550_CR26","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1016\/0041-5553(63)90382-3","volume":"3","author":"BT Polyak","year":"1963","unstructured":"Polyak, B.T.: Gradient methods for the minimisation of functionals. USSR Comput. Math. Math. Phys. 3(4), 864\u2013878 (1963)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"1","key":"1550_CR27","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02096261","volume":"46","author":"ZQ Luo","year":"1993","unstructured":"Luo, Z.Q., Tseng, P.: Error bounds and convergence analysis of feasible descent methods: a general approach. Ann. Oper. Res. 46(1), 157\u2013178 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"5","key":"1550_CR28","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1007\/s11590-014-0795-x","volume":"9","author":"H Zhang","year":"2015","unstructured":"Zhang, H., Cheng, L.: Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization. Optim. Lett. 9(5), 961\u2013979 (2015)","journal-title":"Optim. Lett."},{"key":"1550_CR29","doi-asserted-by":"crossref","unstructured":"Karimi, H., Nutini, J., Schmidt, M.: Linear convergence of gradient and proximal-gradient methods under the polyak-\u0142jasiewicz condition. In: Machine Learning and Knowledge Discovery in Databases, pp. 795\u2013811 (2016)","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"1550_CR30","first-page":"1","volume":"175","author":"I Necoara","year":"2018","unstructured":"Necoara, I., Nesterov, Y., Glineur, F.: Linear convergence of first order methods for non-strongly convex optimization. Math. Program. 175, 1\u201339 (2018)","journal-title":"Math. Program."},{"issue":"4","key":"1550_CR31","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1137\/S1052623499359178","volume":"10","author":"M Anitescu","year":"2000","unstructured":"Anitescu, M.: Degenerate nonlinear programming with a quadratic growth condition. SIAM J. Optim. 10(4), 1116\u20131135 (2000)","journal-title":"SIAM J. Optim."},{"key":"1550_CR32","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer, New York (2006)"},{"issue":"4","key":"1550_CR33","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1080\/10556788.2017.1296439","volume":"32","author":"AMC So","year":"2017","unstructured":"So, A.M.C., Zhou, Z.: Non-asymptotic convergence analysis of inexact gradient methods for machine learning without strong convexity. Optim. Methods Softw. 32(4), 963\u2013992 (2017)","journal-title":"Optim. Methods Softw."},{"key":"1550_CR34","unstructured":"Zhang, H., Yin, W.: Gradient methods for convex minimization: better rates under weaker conditions. Technical report, CAM report 13\u201317, UCLA (2013)"},{"key":"1550_CR35","unstructured":"Zhou, D.R., Xu, P., Gu, Q.: Stochastic Nested Variance Reduction for Nonconvex Optimization (2018). arXiv:1806.07811v1 [cs.LG]"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01550-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-020-01550-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01550-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,18]],"date-time":"2021-02-18T23:40:23Z","timestamp":1613691623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-020-01550-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,17]]},"references-count":35,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["1550"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01550-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,17]]},"assertion":[{"value":"4 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}