{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T21:55:07Z","timestamp":1767995707389,"version":"3.49.0"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T00:00:00Z","timestamp":1754092800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T00:00:00Z","timestamp":1754092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007109","name":"Universit\u00e0 degli Studi di Ferrara","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007109","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2026,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Regularized empirical risk minimization problems arise in a variety of applications, including machine learning, signal processing, and image processing. Proximal stochastic gradient algorithms are a standard approach to solve these problems due to their low computational cost per iteration and a relatively simple implementation. This paper introduces a class of proximal stochastic gradient methods built on three key elements: a variable metric underlying the iterations, a stochastic line search governing the decrease properties and an incremental mini-batch size technique based on additional sampling. Convergence results for the proposed algorithms are proved under different hypotheses on the function to minimize. No assumption is required regarding the Lipschitz continuity of the gradient of the differentiable part of the objective function. Possible strategies to automatically select the parameters of the suggested scheme are discussed. Numerical experiments on both binary classification and nonlinear regression problems show the effectiveness of the suggested approach compared to other state-of-the-art proximal stochastic gradient methods.<\/jats:p>","DOI":"10.1007\/s10589-025-00720-w","type":"journal-article","created":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T09:30:31Z","timestamp":1754127031000},"page":"157-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Variable metric proximal stochastic gradient methods with additional sampling"],"prefix":"10.1007","volume":"93","author":[{"given":"Nata\u0161a","family":"Krklec Jerinki\u0107","sequence":"first","affiliation":[]},{"given":"Federica","family":"Porta","sequence":"additional","affiliation":[]},{"given":"Valeria","family":"Ruggiero","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5737-1679","authenticated-orcid":false,"given":"Ilaria","family":"Trombini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,2]]},"reference":[{"key":"720_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The Elements of Statistical Learning: Data Mining, Inference, and Prediction","author":"T Hastie","year":"2009","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer, New York (2009)"},{"issue":"2","key":"720_CR2","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":"720_CR3","first-page":"9","volume-title":"Online Learning and Stochastic Approximations","author":"L Bottou","year":"1998","unstructured":"Bottou, L.: Online Learning and Stochastic Approximations, pp. 9\u201342. Cambridge University Press, New York (1998)"},{"key":"720_CR4","volume-title":"Deep Learning","author":"I Goodfellow","year":"2016","unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning, vol. 1. MIT Press, Cambridge (2016)"},{"key":"720_CR5","volume-title":"Optimization for Machine Learning","author":"S Sra","year":"2012","unstructured":"Sra, S., Nowozin, S., Wright, S.J.: Optimization for Machine Learning. MIT Press, Cambridge (2012)"},{"key":"720_CR6","doi-asserted-by":"publisher","DOI":"10.1887\/0750304359","volume-title":"Introduction to Inverse Problems in Imaging","author":"M Bertero","year":"1998","unstructured":"Bertero, M., Boccacci, P.: Introduction to Inverse Problems in Imaging. Institute of Physics, Bristol (1998)"},{"key":"720_CR7","doi-asserted-by":"publisher","DOI":"10.1088\/2053-2563\/aae109","author":"M Bertero","year":"2018","unstructured":"Bertero, M., Boccacci, P., Ruggiero, V.: Inverse imaging with Poisson data. Inst. Phys. (2018). https:\/\/doi.org\/10.1088\/2053-2563\/aae109","journal-title":"Inst. Phys."},{"key":"720_CR8","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":"720_CR9","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., Burachik, R., Combettes, P., Elser, V., Luke, D., Wolkowicz, H. (eds.) Fixed-Point Algorithms for Inverse Problems in Science and Engineering. Springer Optimization and Its Applications, vol. 49, pp. 185\u2013212. Springer, New York (2011)"},{"key":"720_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. Math. Program. 137, 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"720_CR11","first-page":"1","volume-title":"Computational Methods for Inverse Problems in Imaging. Springer INdAM Series","author":"S Bonettini","year":"2019","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. Springer, Cham (2019)"},{"key":"720_CR12","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":"720_CR13","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10957-013-0465-7","volume":"162","author":"E Chouzenoux","year":"2014","unstructured":"Chouzenoux, E., Pesquet, J.C., Repetti, A.: Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function. J. Optim. Theory Appl. 162, 107\u2013132 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"720_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.na.2012.09.008","volume":"78","author":"PL Combettes","year":"2013","unstructured":"Combettes, P.L., V\u0169, B.: Variable metric quasi-F\u00e9jer monotonicity. Nonlinear Anal. 78, 17\u201331 (2013)","journal-title":"Nonlinear Anal."},{"key":"720_CR15","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1007\/s10957-014-0642-3","volume":"165","author":"P Frankel","year":"2015","unstructured":"Frankel, P., Garrigos, G., Peypouquet, J.: Splitting methods with variable metric for Kurdyka-Lojasiewicz functions and general convergence rates. J. Optim. Theory Appl. 165, 874\u2013900 (2015)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"720_CR16","doi-asserted-by":"publisher","first-page":"2153","DOI":"10.1137\/16M1073741","volume":"27","author":"S Salzo","year":"2017","unstructured":"Salzo, S.: The variable metric forward-backward splitting algorithm under mild differentiability assumptions. SIAM J. Optim. 27(4), 2153\u20132181 (2017)","journal-title":"SIAM J. Optim."},{"key":"720_CR17","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s10957-023-02297-y","volume":"199","author":"A Khaled","year":"2023","unstructured":"Khaled, A., Sebbouh, O., Loizou, N., Gower, R.M., Richt\u00e1rik, P.: Unified analysis of stochastic gradient methods for composite convex and smooth optimization. J. Optim. Theory Appl. 199, 499\u2013540 (2023)","journal-title":"J. Optim. Theory Appl."},{"key":"720_CR18","first-page":"2899","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, 2899\u20132934 (2009)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"720_CR19","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":"1","key":"720_CR20","doi-asserted-by":"publisher","first-page":"127","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), 127\u2013155 (2012)","journal-title":"Math. Program."},{"key":"720_CR21","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10107-017-1137-4","volume":"169","author":"C Cartis","year":"2015","unstructured":"Cartis, C., Scheinberg, K.: Global convergence rate analysis of unconstrained optimization methods based on probabilistic models. Math. Program. 169, 337\u2013375 (2015)","journal-title":"Math. Program."},{"key":"720_CR22","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, 23 (2023)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"720_CR23","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."},{"issue":"3","key":"720_CR24","doi-asserted-by":"publisher","first-page":"1380","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), 1380\u20131405 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"720_CR25","first-page":"3959","volume":"2014","author":"FH Hashemi","year":"2014","unstructured":"Hashemi, F.H., Ghosh, S., Pasupathy, R.: On adaptive sampling rules for stochastic recursions. Simul. Conf. (WSC) 2014, 3959\u20133970 (2014)","journal-title":"Simul. Conf. (WSC)"},{"key":"720_CR26","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. Proceedings of Machine Learning Research, vol. 80, pp. 4124\u20134132 (2018)"},{"issue":"4","key":"720_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":"720_CR28","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":"720_CR29","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, Curran Associates Inc., vol. 216, pp. 2406\u20132416 (2019)"},{"key":"720_CR30","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s11222-023-10230-6","volume":"33","author":"G Fort","year":"2023","unstructured":"Fort, G., Moulines, E.: Stochastic variable metric proximal gradient with variance reduction for non-convex composite optimization. Stat. Comput. 33, 65 (2023)","journal-title":"Stat. Comput."},{"key":"720_CR31","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: Saga: A fast incremental gradient method with support for non-strongly convex composite objectives. In: Advances in Neural Information Processing Systems, pp. 1646\u20131654 (2014)"},{"key":"720_CR32","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. In: Advances in Neural Information Processing Systems, pp. 315\u2013323 (2013)"},{"issue":"3","key":"720_CR33","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.1137\/130915984","volume":"24","author":"AS Bandeira","year":"2014","unstructured":"Bandeira, A.S., Scheinberg, K., Vicente, L.N.: Convergence of trust-region methods based on probabilistic models. SIAM J. Optim. 24(3), 1238\u20131264 (2014)","journal-title":"SIAM J. Optim."},{"key":"720_CR34","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1287\/ijoo.2019.0016","volume":"1","author":"J Blanchet","year":"2019","unstructured":"Blanchet, J., Cartis, C., Menickelly, M., Scheinberg, K.: Convergence rate analysis of a stochastic trust region method via submartingales. Informs J. Optim. 1, 92\u2013119 (2019)","journal-title":"Informs J. Optim."},{"issue":"2","key":"720_CR35","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10107-017-1141-8","volume":"169","author":"R Chen","year":"2018","unstructured":"Chen, R., Menickelly, M., Scheinberg, K.: Stochastic optimization using a trust-region method and random models. Math. Program. 169(2), 447\u2013487 (2018)","journal-title":"Math. Program."},{"issue":"2","key":"720_CR36","doi-asserted-by":"publisher","first-page":"294","DOI":"10.4208\/jcm.2012-m2020-0144","volume":"40","author":"W Xiaoyu","year":"2022","unstructured":"Xiaoyu, W., Yuan, Y.X.: Stochastic trust region methods with trust region radius depending on probabilistic models. J. Comput. Math. 40(2), 294\u2013334 (2022)","journal-title":"J. Comput. Math."},{"key":"720_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2024.116083","volume":"451","author":"G Franchini","year":"2024","unstructured":"Franchini, G., Porta, F., Ruggiero, V., Trombini, I., Zanni, L.: A stochastic gradient method with variance control and variable learning rate for deep learning. J. Comput. Appl. Math. 451, 116083 (2024)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"720_CR38","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":"720_CR39","first-page":"3312","volume":"32","author":"S Vaswani","year":"2018","unstructured":"Vaswani, S., Mishkin, A., Laradji, I., Schmidt, M., Gidel, G., Lacoste-Julien, S.: Painless stochastic gradient; interpolation, line-search, and convergence rates. Adv. Neural. Inf. Process. Syst. 32, 3312\u20133343 (2018)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"341","key":"720_CR40","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1090\/mcom\/3802","volume":"92","author":"D di Serafino","year":"2023","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(341), 1273\u20131299 (2023)","journal-title":"Math. Comput."},{"key":"720_CR41","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10589-025-00664-1","volume":"91","author":"N Krklec Jerinki\u0107","year":"2025","unstructured":"Krklec Jerinki\u0107, N., Trombini, I., Ruggiero, V.: Spectral stochastic gradient method with additional sampling for finite and infinite sums. Comput. Optim. Appl. 91, 717\u2013758 (2025)","journal-title":"Comput. Optim. Appl."},{"key":"720_CR42","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2024.2426620","author":"S Bellavia","year":"2024","unstructured":"Bellavia, S., Kreji\u0107, N., Jerinki\u0107, N.K., Raydan, M.: SLiSeS: Subsampled line search spectral gradient method for finite sums. Optim. Methods Softw. (2024). https:\/\/doi.org\/10.1080\/10556788.2024.2426620","journal-title":"Optim. Methods Softw."},{"key":"720_CR43","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10589-024-00580-w","volume":"89","author":"N Kreji\u0107","year":"2024","unstructured":"Kreji\u0107, N., Krklec Jerinki\u0107, N., Mart\u00ednez, A., Yousefi, M.: A non-monotone trust-region method with noisy oracles and additional sampling. Comput. Optim. Appl. 89, 247\u2013278 (2024)","journal-title":"Comput. Optim. Appl."},{"key":"720_CR44","volume-title":"Introduction to Optimization","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to Optimization. Optimization Software, New York (1987)"},{"issue":"2","key":"720_CR45","doi-asserted-by":"publisher","first-page":"299","DOI":"10.3934\/jimo.2008.4.299","volume":"4","author":"G Frassoldati","year":"2008","unstructured":"Frassoldati, G., Zanghirati, G., Zanni, L.: New adaptive stepsize selections in gradient methods. J. Ind. Manag. Optim. 4(2), 299\u2013312 (2008)","journal-title":"J. Ind. Manag. Optim."},{"key":"720_CR46","first-page":"2121","volume":"12","author":"JC Duchi","year":"2011","unstructured":"Duchi, J.C., Hazan, E., Singer, Y.: Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res. 12, 2121\u20132159 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"720_CR47","unstructured":"Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. In: 3rd International Conference on Learning Representations, ICLR (2015)"},{"key":"720_CR48","unstructured":"Zhuang, J., Tang, T., Ding, Y., Tatikonda, S.C., Dvornek, N., Papademetris, X., Duncan, J.: Adabelief optimizer: adapting stepsizes by the belief in observed gradients. In: Adv. Neural Inf. Process. Syst. 33 (2020)"},{"issue":"1","key":"720_CR49","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009). https:\/\/doi.org\/10.1137\/080716542","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"720_CR50","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/080716542","volume":"166","author":"A Chambolle","year":"2015","unstructured":"Chambolle, A., Dossal, C.H.: On the convergence of the iterates of \u201dFISTA\u201d. J. Optim. Theory Appl. 166(3), 25 (2015). https:\/\/doi.org\/10.1137\/080716542","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"720_CR51","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0022-247X(79)90234-8","volume":"72","author":"GB Passty","year":"1979","unstructured":"Passty, G.B.: Ergodic convergence to a zero of the sum of monotone operators in Hilbert space. J. Math. Anal. Appl. 72(1), 383\u2013390 (1979)","journal-title":"J. Math. Anal. Appl."},{"key":"720_CR52","volume-title":"SpiderBoost and Momentum: Faster Stochastic Variance Reduction Algorithms","author":"Z Wang","year":"2019","unstructured":"Wang, Z., Ji, K., Zhou, Y., Liang, Y., Tarokh, V.: SpiderBoost and Momentum: Faster Stochastic Variance Reduction Algorithms. Curran Associates Inc., Red Hook (2019)"},{"key":"720_CR53","unstructured":"D\u00e9fossez, A., Bottou, L., Bach, F., Usunier, N.: A simple convergence proof of Adamand Adagrad Trans. Mach. Learn. Res. arXiv preprint arXiv:2003.02395 (2022)"},{"issue":"2","key":"720_CR54","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s40305-022-00436-2","volume":"11","author":"TT Yu","year":"2022","unstructured":"Yu, T.T., Liu, X.W., Dai, Y.H., Sun, J.: A mini-batch proximal stochastic recursive gradient algorithm with diagonal Barzilai-Borwein stepsize. J. Oper. Res. Soc. China 11(2), 277\u2013307 (2022)","journal-title":"J. Oper. Res. Soc. China"},{"key":"720_CR55","unstructured":"Lichman, M.: UCI machine learning repository (2013). https:\/\/archive.ics.uci.edu\/ml\/index.php"},{"key":"720_CR56","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.snb.2007.09.060","volume":"129","author":"S De Vito","year":"2008","unstructured":"De Vito, S., Massera, E., Piga, M., Martinotto, L., Di Francia, G.: On field calibration of an electronic nose for benzene estimation in an urban pollution monitoring scenario. Sens. Actuator B 129, 750\u2013757 (2008)","journal-title":"Sens. Actuator B"},{"key":"720_CR57","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."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00720-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00720-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00720-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T16:02:07Z","timestamp":1767974527000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00720-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,2]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["720"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00720-w","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,2]]},"assertion":[{"value":"11 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2025","order":3,"name":"first_online","label":"First Online","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"}}]}}