{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:42:13Z","timestamp":1743151333349,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031812408"},{"type":"electronic","value":"9783031812415"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-81241-5_7","type":"book-chapter","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T13:45:43Z","timestamp":1735652743000},"page":"94-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Line Search Stochastic Gradient Algorithm with\u00a0A-priori Rule for\u00a0Monitoring the\u00a0Control of\u00a0the\u00a0Variance"],"prefix":"10.1007","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-0002-0713-5421","authenticated-orcid":false,"given":"Federica","family":"Porta","sequence":"additional","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-5737-1679","authenticated-orcid":false,"given":"Ilaria","family":"Trombini","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":[[2025,1,1]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10589-022-00430-7","volume":"84","author":"S Bellavia","year":"2023","unstructured":"Bellavia, S., Kreji\u0107, N., Morini, B., Rebegoldi, S.: A stochastic first-order trust-region method with inexact restoration for finite-sum minimization. Comput. Optim. Appl. 84, 53\u201384 (2023)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.2478\/caim-2020-0002","volume":"11","author":"S Bellavia","year":"2020","unstructured":"Bellavia, S., Jerinki\u0107, N.K., Malaspina, G.: Subsampled nonmonotone spectral gradient methods. Commun. Appl. Industr. Math. 11(1), 19\u201334 (2020)","journal-title":"Commun. Appl. Industr. Math."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bellavia, S., Kreji\u0107, N., Krklec\u00a0Jerinki\u0107, N.: Subsampled inexact Newton methods for minimizing large sums of convex functions. IMA J. Numer. Anal. 40(4), 2309\u20132341 (2019)","DOI":"10.1093\/imanum\/drz027"},{"issue":"4","key":"7_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."},{"issue":"2","key":"7_CR5","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":"7_CR6","doi-asserted-by":"crossref","unstructured":"Bottou, L.: On-Line Learning and Stochastic Approximations, pp. 9\u201342. Cambridge University Press, Cambridge (1999)","DOI":"10.1017\/CBO9780511569920.003"},{"key":"7_CR7","first-page":"1","volume":"1","author":"C Cartis","year":"2015","unstructured":"Cartis, C., Scheinberg, K.: Global convergence rate analysis of unconstrained optimization methods based on probabilistic models. Math. Program. 1, 1\u201339 (2015)","journal-title":"Math. Program."},{"key":"7_CR8","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: Saga: a fast incremental gradient method with support for non-strongly convex composite objectives. In: Ghahramani, Z., Welling, M., Cortes, C., Lawrence, N., Weinberger, K. (eds.) Advances in Neural Information Processing Systems, vol. 27 Curran Associates, Inc. (2014). https:\/\/proceedings.neurips.cc\/paper files\/paper\/2014\/file\/ede7e2b6d13a41ddf9f4bdef84fdc737-Paper.pdf"},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10915-022-02084-3","volume":"94","author":"G Franchini","year":"2023","unstructured":"Franchini, G., Porta, F., Ruggiero, V., Trombini, I.: A line search based proximal stochastic gradient algorithm with dynamical variance reduction. J. Sci. Comput. 94(1), 23 (2023)","journal-title":"J. Sci. Comput."},{"issue":"23","key":"7_CR10","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(23), 17573\u201317588 (2020). https:\/\/doi.org\/10.1007\/s00500-020-05219-6","journal-title":"Soft. Comput."},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"2164000","DOI":"10.1080\/27690911.2022.2164000","volume":"31","author":"G Franchini","year":"2023","unstructured":"Franchini, G., Porta, F., Ruggiero, V., Trombini, I., Zanni, L.: Learning rate selection in stochastic gradient methods based on line search strategies. Appl. Math. Sci. Eng. 31(1), 2164000 (2023)","journal-title":"Appl. Math. Sci. Eng."},{"key":"7_CR12","unstructured":"Freund, J.E.: Mathematical statistics, 2nd ed. edn. Prentice-Hall, Englewood Cliffs (1971)"},{"issue":"3","key":"7_CR13","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(3), A1380\u2013A1405 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"7_CR14","unstructured":"Golmant, N., et al.: On the computational inefficiency of large batch sizes for stochastic gradient descent. arXiv:1811.12941v1 (2018)"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Hashemi F.S., Ghosh S., Pasupathy R.: On adaptive sampling rules for stochastic recursions. In: Proceedings of the Winter Simulation Conference 2014, Savannah, GA, USA, 2014, pp. 3959\u20133970 (2014). https:\/\/doi.org\/10.1109\/WSC.2014.7020221","DOI":"10.1109\/WSC.2014.7020221"},{"key":"7_CR16","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. In: Proceedings of the 26th International Conference on Neural Information Processing Systems, vol. 1, pp. 315\u2013323. Curran Associates Inc. (2013)"},{"key":"7_CR17","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: Precup, D., Teh, Y.W. (eds.) Proceedings of the 34th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 70, pp. 2613\u20132621. PMLR (2017). https:\/\/proceedings.mlr.press\/v70\/nguyen17b.html"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Byrd, R.H., Chin, G.M., Nocedal, J., Wu, Y.: Sample size selection in optimization methods for machine learning. Math. Program. 134(1), 127\u2013155 (2012). https:\/\/doi.org\/10.1007\/s10107-012-0572-5","DOI":"10.1007\/s10107-012-0572-5"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"di Serafino, D., Kreji\u0107, N., Jerinki\u0107, N.K., Viola, M.: LSOS: line-search second-order stochastic optimization methods for nonconvex finite sums. Math. Comput. 92, 1273\u20131299 (2020). https:\/\/api.semanticscholar.org\/CorpusID:220919843","DOI":"10.1090\/mcom\/3802"},{"key":"7_CR20","unstructured":"Tan, C., Ma, S., Dai, Y.H., Qian, Y.: Barzilai-borwein step size for stochastic gradient descent. In: Lee, D., Sugiyama, M., Luxburg, U., Guyon, I., Garnett, R. (eds.) Advances in Neural Information Processing Systems. vol. 29. Curran Associates, Inc. (2016). https:\/\/proceedings.neurips.cc\/paper files\/paper\/2016\/file\/c86a7ee3d8ef0b551ed58e354a836f2b-Paper.pdf"},{"key":"7_CR21","unstructured":"Vaswani, S., Mishkin, A., Laradji, I., Schmidt, M., Gidel, G., Lacoste-Julien, S.: Painless stochastic gradient; interpolation, line-search, and convergence rates. In: Wallach, H., Larochelle, H., Beygelzimer, A., d\u2019Alch\u00e9-Buc, F., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 32, Curran Associates, Inc. (2019). https:\/\/proceedings.neurips.cc\/paper files\/paper\/2019\/file\/2557911c1bf75c2b643afb4ecbfc8ec2-Paper.pdf"},{"key":"7_CR22","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-Borwein update step. Neurocomputing 314, 177\u2013185 (2018)","journal-title":"Neurocomputing"}],"container-title":["Lecture Notes in Computer Science","Numerical Computations: Theory and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81241-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T14:02:59Z","timestamp":1735653779000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81241-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031812408","9783031812415"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81241-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"NUMTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Numerical Computations: Theory and Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pizzo Calabro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"numta2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.numta.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}