{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T22:05:22Z","timestamp":1780610722361,"version":"3.54.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T00:00:00Z","timestamp":1671753600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T00:00:00Z","timestamp":1671753600000},"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 Sci Comput"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10915-022-02084-3","type":"journal-article","created":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T20:02:45Z","timestamp":1671825765000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["A Line Search Based Proximal Stochastic Gradient Algorithm with Dynamical Variance Reduction"],"prefix":"10.1007","volume":"94","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9082-8087","authenticated-orcid":false,"given":"Giorgia","family":"Franchini","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Federica","family":"Porta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Valeria","family":"Ruggiero","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ilaria","family":"Trombini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,12,23]]},"reference":[{"key":"2084_CR1","doi-asserted-by":"crossref","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward\u2013backward splitting, and regularized Gauss\u2013Seidel methods. Math. Program. Ser. A 137(1), 91\u2013129 (2013)","DOI":"10.1007\/s10107-011-0484-9"},{"key":"2084_CR2","first-page":"251","volume-title":"Convex Optimization Theory, Chapter 6 on Convex Optimization Algorithms","author":"D Bertsekas","year":"2009","unstructured":"Bertsekas, D.: Convex Optimization Theory, Chapter 6 on Convex Optimization Algorithms, pp. 251\u2013489. Athena Scientific, Belmont (2009)"},{"issue":"2","key":"2084_CR3","doi-asserted-by":"publisher","first-page":"1489","DOI":"10.1137\/19M1291832","volume":"31","author":"AS Berahas","year":"2021","unstructured":"Berahas, A.S., Cao, L., Scheinberg, K.: Global convergence rate analysis of a generic line search algorithm with noise. SIAM J. Optim. 31(2), 1489\u20131518 (2021)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2084_CR4","doi-asserted-by":"publisher","first-page":"3312","DOI":"10.1137\/17M1154679","volume":"28","author":"R Bollapragada","year":"2018","unstructured":"Bollapragada, R., Byrd, R., Nocedal, J.: Adaptive sampling strategies for stochastic optimization. SIAM J. Optim. 28(4), 3312\u20133343 (2018)","journal-title":"SIAM J. Optim."},{"key":"2084_CR5","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1137\/15M1019325","volume":"26","author":"S Bonettini","year":"2016","unstructured":"Bonettini, S., Loris, I., Porta, F., Prato, M.: Variable metric inexact line-search based methods for nonsmooth optimization. SIAM J. Optim. 26, 891\u2013921 (2016)","journal-title":"SIAM J. Optim."},{"key":"2084_CR6","doi-asserted-by":"crossref","unstructured":"Bonettini, S., Porta, F., Prato, M., Rebegoldi, S., Ruggiero, V., Zanni, L.: Recent advances in variable metric first-order methods. In: Donatelli, M., Serra-Capizzano, S. (eds.) Computational Methods for Inverse Problems in Imaging. Springer INDAM Series, vol. 36, pp. 1\u201331 (2019)","DOI":"10.1007\/978-3-030-32882-5_1"},{"issue":"2","key":"2084_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."},{"key":"2084_CR8","doi-asserted-by":"crossref","unstructured":"Bottou, L.: Online algorithms and stochastic approximations, in online learning and neural networks. In: Saad, D. (ed.) Cambridge University Press, Cambridge (1998). https:\/\/leon.bottou.org\/publications\/pdf\/online-1998.pdf","DOI":"10.1017\/CBO9780511569920.003"},{"issue":"1","key":"2084_CR9","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/s10107-012-0572-5","volume":"134","author":"RH Byrd","year":"2012","unstructured":"Byrd, R.H., Chin, G.M., Nocedal, J., Wu, Y.: Sample size selection in optimization methods for machine learning. Math. Program. 134(1), 128\u2013155 (2012)","journal-title":"Math. Program."},{"key":"2084_CR10","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-1-4419-9569-8_10","volume-title":"Fixed-Point Algorithms for Inverse Problems in Science and Engineering","author":"PL Combettes","year":"2011","unstructured":"Combettes, P.L., Pesquet, J.-C.: Proximal splitting methods in signal processing. In: Bauschke, H.H., Burachik, R.S., Combettes, P.L., Elser, V., Luke, D.R., Wolkowicz, H. (eds.) Fixed-Point Algorithms for Inverse Problems in Science and Engineering. Springer Optimization and Its Applications, pp. 185\u2013212. Springer, New York (2011)"},{"key":"2084_CR11","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward-backward splitting. SIAM Multiscale Model. Simul. 4, 1168\u20131200 (2005)","journal-title":"SIAM Multiscale Model. Simul."},{"key":"2084_CR12","first-page":"2873","volume":"10","author":"J Duchi","year":"2009","unstructured":"Duchi, J., Singer, Y.: Efficient online and batch learning using forward backward splitting. J. Mach. Learn. Res. 10, 2873\u20132898 (2009)","journal-title":"J. Mach. Learn. Res."},{"key":"2084_CR13","doi-asserted-by":"publisher","first-page":"17573","DOI":"10.1007\/s00500-020-05219-6","volume":"24","author":"G Franchini","year":"2020","unstructured":"Franchini, G., Ruggiero, V., Zanni, L.: Ritz-like values in steplength selections for stochastic gradient methods. Soft. Comput. 24, 17573\u201317588 (2020)","journal-title":"Soft. Comput."},{"key":"2084_CR14","first-page":"4124","volume":"2021","author":"G Franchini","year":"2021","unstructured":"Franchini, G., Ruggiero, V., Trombini, I.: Automatic steplength selection in Stochastic gradient methods. Mach. Learn. Optim. Data Sci. LOD 2021, 4124\u20134132 (2021)","journal-title":"Mach. Learn. Optim. Data Sci. LOD"},{"key":"2084_CR15","volume-title":"Mathematical Statistics","author":"JE Freund","year":"1962","unstructured":"Freund, J.E.: Mathematical Statistics. Prentice-Hall, Englewood Cliffs (1962)"},{"issue":"4","key":"2084_CR16","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. Optim. 23(4), 2341\u20132368 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2084_CR17","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1137\/17M1144799","volume":"29","author":"AN Iusem","year":"2019","unstructured":"Iusem, A.N., Jofr\u00e8, A., Oliveira, R.I., Thompson, P.: Variance-based extragradient methods with line search for stochastic variational inequalities. SIAM J. Optim. 29(1), 175\u2013206 (2019)","journal-title":"SIAM J. Optim."},{"key":"2084_CR18","unstructured":"Le, T.V., Gopee, N.: Classifying CIFAR-10 images using unsupervised feature & ensemble learning. https:\/\/trucvietle.me\/files\/601-report.pdf"},{"issue":"1","key":"2084_CR19","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/18M1216250","volume":"30","author":"C Paquette","year":"2020","unstructured":"Paquette, C., Scheinberg, K.: A stochastic line search method with expected complexity analysis. SIAM J. Optim. 30(1), 349\u2013376 (2020)","journal-title":"SIAM J. Optim."},{"key":"2084_CR20","volume-title":"Introduction to Optimization","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to Optimization. Optimization Software, New York (1987)"},{"key":"2084_CR21","unstructured":"Poon, C., Liang, J., Schoenlieb, C.: Local Convergence properties of SAGA\/Prox-SVRG and acceleration, PMLR. In: Proceedings of the 35th International Conference on Machine Learning, vol. 80, pp. 4124\u20134132 (2018)"},{"key":"2084_CR22","first-page":"1","volume":"21","author":"NH Phamy","year":"2020","unstructured":"Phamy, N.H., Nguyen, L.M., Phan, D.T., Tran-Dinh, Q.: ProxSARAH: an effcient algorithmic framework for stochastic composite nonconvex optimization. J. Mach. Learn. Res. 21, 1\u201348 (2020)","journal-title":"J. Mach. Learn. Res."},{"key":"2084_CR23","unstructured":"Poon, C., Liang, J., Schoenlieb, C.: Local convergence properties of SAGA\/Prox-SVRG and acceleration. In: Dy, J., Krause, A (eds.) Proceedings of the 35th International Conference on Machine Learning, PMLR, Proceedings of Machine Learning Research, vol. 80, pp. 4124\u20134132 (2018)"},{"key":"2084_CR24","series-title":"Grundlehren der Mathematischen Wissenschaften","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.-B., Wets, M.: Variational Analysis. Grundlehren der Mathematischen Wissenschaften, vol. 317. Springer, Berlin (1998)"},{"issue":"1","key":"2084_CR25","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10107-016-1030-6","volume":"162","author":"M Schmidt","year":"2017","unstructured":"Schmidt, M., Le Roux, N., Bach, F.: Minimizing finite sums with the stochastic average gradient. Math. Program. 162(1), 83\u2013112 (2017)","journal-title":"Math. Program."},{"key":"2084_CR26","unstructured":"Wang, Z., Ji, K., Zhou, Y., Liang, Y., Tarokh, V.: SpiderBoost and momentum: faster stochastic variance reduction algorithms. In: Proceedings of the 33rd International Conference on Neural Information Processing Systems, vol. 216, pp. 2406\u20132416. Curran Associates Inc. (2019)"},{"issue":"4","key":"2084_CR27","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":"2084_CR28","doi-asserted-by":"publisher","first-page":"2177","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-Borwein update step. Neurocomputing 314, 2177\u2013185 (2018)","journal-title":"Neurocomputing"}],"updated-by":[{"DOI":"10.1007\/s10915-023-02267-6","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T00:00:00Z","timestamp":1687478400000}}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-022-02084-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-022-02084-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-022-02084-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T18:41:52Z","timestamp":1687545712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-022-02084-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,23]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["2084"],"URL":"https:\/\/doi.org\/10.1007\/s10915-022-02084-3","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10915-023-02267-6","asserted-by":"object"}]},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,23]]},"assertion":[{"value":"22 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2023","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10915-023-02267-6","URL":"https:\/\/doi.org\/10.1007\/s10915-023-02267-6","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"23"}}