{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T08:08:24Z","timestamp":1746864504417,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"23","license":[{"start":{"date-parts":[[2020,8,18]],"date-time":"2020-08-18T00:00:00Z","timestamp":1597708800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,18]],"date-time":"2020-08-18T00:00:00Z","timestamp":1597708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s00500-020-05219-6","type":"journal-article","created":{"date-parts":[[2020,8,18]],"date-time":"2020-08-18T11:02:49Z","timestamp":1597748569000},"page":"17573-17588","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Ritz-like values in steplength selections for stochastic gradient methods"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9082-8087","authenticated-orcid":false,"given":"Giorgia","family":"Franchini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5885-1703","authenticated-orcid":false,"given":"Valeria","family":"Ruggiero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9471-9128","authenticated-orcid":false,"given":"Luca","family":"Zanni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,18]]},"reference":[{"issue":"4","key":"5219_CR1","doi-asserted-by":"publisher","first-page":"2881","DOI":"10.1137\/18M1226282","volume":"29","author":"S Bellavia","year":"2019","unstructured":"Bellavia S, Gurioli G, Morini B, Toint PL (2019) Adaptive regularization algorithms with inexact evaluations for nonconvex optimization. SIAM J Optim 29(4):2881\u20132915","journal-title":"SIAM J Optim"},{"issue":"4","key":"5219_CR2","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 (2018) Adaptive sampling strategies for stochastic optimization. SIAM J Optim 28(4):3312\u20133343","journal-title":"SIAM J Optim"},{"issue":"2","key":"5219_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou L, Curtis FE, Nocedal J (2018) Optimization methods for large-scale machine learning. SIAM Rev 60(2):223\u2013311","journal-title":"SIAM Rev"},{"issue":"134","key":"5219_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-012-0572-5","volume":"1","author":"RH Byrd","year":"2012","unstructured":"Byrd RH, Chin GM, Nocedal J, Wu Y (2012) Sample size selection in optimization methods for machine learning. Math Program 1(134):127\u2013155","journal-title":"Math Program"},{"key":"5219_CR5","first-page":"1","volume":"1","author":"C Cartis","year":"2015","unstructured":"Cartis C, Scheinberg K (2015) Global convergence rate analysis of unconstrained optimization methods based on probabilistic models. Math Program 1:1\u201339","journal-title":"Math Program"},{"issue":"2","key":"5219_CR6","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1093\/imanum\/drv034","volume":"36","author":"FE Curtis","year":"2016","unstructured":"Curtis FE, Guo W (2016) Handling nonpositive curvature in a limited memory steepest descent method. IMA J Numer Anal 36(2):717\u2013742. https:\/\/doi.org\/10.1093\/imanum\/drv034","journal-title":"IMA J Numer Anal"},{"key":"5219_CR7","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1093\/imanum\/23.3.377","volume":"23","author":"YH Dai","year":"2003","unstructured":"Dai YH, Yuan Y (2003) Alternate minimization gradient method. IMA J Numer Anal 23:377\u2013393","journal-title":"IMA J Numer Anal"},{"key":"5219_CR8","unstructured":"Defazio A, Bach FR, Lacoste-Julien S (2014) SAGA: a fast incremental gradient method with support for non-strongly convex composite objectives. In: NIPS"},{"key":"5219_CR9","first-page":"176","volume":"318","author":"D di Serafino","year":"2018","unstructured":"di Serafino D, Ruggiero V, Toraldo G, Zanni L (2018) On the steplength selection in gradient methods for unconstrained optimization. Appl Math Comput 318:176\u2013195","journal-title":"Appl Math Comput"},{"key":"5219_CR10","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s10107-011-0479-6","volume":"135","author":"R Fletcher","year":"2012","unstructured":"Fletcher R (2012) A limited memory steepest descent method. Math Program Ser A 135:413\u2013436","journal-title":"Math Program Ser A"},{"key":"5219_CR11","volume-title":"Numerical computations: theory and algorithms (NUMTA, 2019). Lecture notes in computer science","author":"G Franchini","year":"2020","unstructured":"Franchini G, Ruggiero V, Zanni L (2020) On the steplength selection in Stochastic Gradient Methods. In: Sergeyev YD, Kvasov DE (eds) Numerical computations: theory and algorithms (NUMTA, 2019). Lecture notes in computer science, vol 11973. Springer, Berlin"},{"issue":"2","key":"5219_CR12","doi-asserted-by":"crossref","first-page":"299","DOI":"10.3934\/jimo.2008.4.299","volume":"4","author":"G Frassoldati","year":"2008","unstructured":"Frassoldati G, Zanghirati G, Zanni L (2008) New adaptive stepsize selections in gradient methods. J Ind Manag Optim 4(2):299\u2013312","journal-title":"J Ind Manag Optim"},{"issue":"3","key":"5219_CR13","doi-asserted-by":"publisher","first-page":"A1380","DOI":"10.1137\/110830629","volume":"34","author":"MP Friedlander","year":"2012","unstructured":"Friedlander MP, Schmidt M (2012) Hybrid deterministic-stochastic methods for data fitting. SIAM J Sci Comput 34(3):A1380\u2013A1405","journal-title":"SIAM J Sci Comput"},{"key":"5219_CR14","doi-asserted-by":"crossref","unstructured":"Hashemi F, Ghosh S, Pasupathy R (2014) In adaptive sampling rules for stochastic recursions. In: Simulation conference (WSC) 2014, Winter, pp 3959\u20133970","DOI":"10.1109\/WSC.2014.7020221"},{"key":"5219_CR15","first-page":"315","volume-title":"Advances in neural information processing systems","author":"R Johnson","year":"2013","unstructured":"Johnson R, Zhang T (2013) Accelerating stochastic gradient descent using predictive variance reduction. In: Burges CJC, Bottou L, Welling M, Ghahramani Z, Weinberger KQ (eds) Advances in neural information processing systems, vol 26. Curran Associates Inc, Red Hook, pp 315\u2013323"},{"key":"5219_CR16","doi-asserted-by":"crossref","unstructured":"Karimi H, Nutini J, Schmidt M, (2016) Linear convergence of gradient and proximal-gradient methods under the Polyak\u2013\u0141ojasiewicz condition. In: Frasconi P, Landwehr N, Manco G, Vreeken J (eds) Machine learning and knowledge discovery in databases ECML PKDD 2016. Lecture notes in computer science, vol 9851. Springer, Berlin","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"5219_CR17","volume-title":"Advances in neural information processing systems 29 (NIPS 2016)","author":"C Tan","year":"2016","unstructured":"Tan C, Ma S, Dai Y, Qian Y (2016) BB step size for SGD. In: Lee D, Sugiyama M, Luxburg U, Guyon I, Garnett R (eds) Advances in neural information processing systems 29 (NIPS 2016). Springer, Berlin"},{"key":"5219_CR18","doi-asserted-by":"publisher","unstructured":"Tropp JA (2015) An introduction to matrix concentration inequalities. Found Trends Mach Lear 8(1\u20132):1\u2013230. https:\/\/doi.org\/10.1561\/2200000048","DOI":"10.1561\/2200000048"},{"key":"5219_CR19","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 (2018) Mini-batch algorithms with Barzilai\u2013Borwein update step. Neurocomputing 314:177\u2013185","journal-title":"Neurocomputing"},{"issue":"1","key":"5219_CR20","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10589-006-6446-0","volume":"35","author":"B Zhou","year":"2006","unstructured":"Zhou B, Gao L, Dai YH (2006) Gradient methods with adaptive step-sizes. Comput Optim Appl 35(1):69\u201386","journal-title":"Comput Optim Appl"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05219-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-020-05219-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05219-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T20:41:57Z","timestamp":1667853717000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-020-05219-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,18]]},"references-count":20,"journal-issue":{"issue":"23","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["5219"],"URL":"https:\/\/doi.org\/10.1007\/s00500-020-05219-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2020,8,18]]},"assertion":[{"value":"18 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"Giorgia Franchini, Valeria Ruggiero and Luca Zanni declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights statement"}}]}}