{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T07:41:45Z","timestamp":1773387705822,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T00:00:00Z","timestamp":1591660800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T00:00:00Z","timestamp":1591660800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Ministry of Education, Science and Technological Development Republic of Serbia","award":["451-03-68\/2020-14\/ 200125"],"award-info":[{"award-number":["451-03-68\/2020-14\/ 200125"]}]},{"name":"Gruppo Nazionale per il Calcolo Scientifico (GNCS-INdAM) of Italy"},{"name":"Gruppo Nazionale per il Calcolo Scientifico (GNCS-INdAM) of Italy"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10589-020-00196-w","type":"journal-article","created":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T13:02:41Z","timestamp":1591707761000},"page":"701-736","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Inexact restoration with subsampled trust-region methods for finite-sum minimization"],"prefix":"10.1007","volume":"76","author":[{"given":"Stefania","family":"Bellavia","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3348-7233","authenticated-orcid":false,"given":"Nata\u0161a","family":"Kreji\u0107","sequence":"additional","affiliation":[]},{"given":"Benedetta","family":"Morini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,9]]},"reference":[{"issue":"1","key":"196_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10287-005-0044-y","volume":"3","author":"F Bastin","year":"2006","unstructured":"Bastin, F., Cirillo, C., Toint, P.L.: An adaptive Monte Carlo algorithm for computing mixed logit estimators. CMS 3(1), 55\u201379 (2006)","journal-title":"CMS"},{"key":"196_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10107-006-0708-6","volume":"108","author":"F Bastin","year":"2006","unstructured":"Bastin, F., Cirillo, C., Toint, P.L.: Convergence theory for nonconvex stochastic programming with an application to mixed logit. Math. Program. 108, 207\u2013234 (2006)","journal-title":"Math. Program."},{"key":"196_CR3","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drz076","author":"S Bellavia","year":"2020","unstructured":"Bellavia, S., Gurioli, G., Morini, B.: Adaptive cubic regularization methods with dynamic inexact Hessian information and applications to finite-sum minimization. IMA J. Numer. Anal. (2020). https:\/\/doi.org\/10.1093\/imanum\/drz076","journal-title":"IMA J. Numer. Anal."},{"issue":"4","key":"196_CR4","doi-asserted-by":"publisher","first-page":"2281","DOI":"10.1137\/18M1226282","volume":"29","author":"S Bellavia","year":"2019","unstructured":"Bellavia, S., Gurioli, G., Morini, B., Toint, PhL: Adaptive regularization algorithms with inexact evaluations for nonconvex optimization. SIAM J. Optim. 29(4), 2281\u20132915 (2019)","journal-title":"SIAM J. Optim."},{"key":"196_CR5","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drz027","author":"S Bellavia","year":"2019","unstructured":"Bellavia, S., Kreji\u0107, N., Krklec Jerinki\u0107, N.: Subsampled Inexact Newton methods for minimizing large sums of convex function. IMA J. Numer. Anal. (2019). https:\/\/doi.org\/10.1093\/imanum\/drz027","journal-title":"IMA J. Numer. Anal."},{"key":"196_CR6","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2020.1725751","author":"AS Berahas","year":"2020","unstructured":"Berahas, A.S., Bollapragada, R., Nocedal, J.: An investigation of Newton-sketch and subsampled Newton methods. Optim. Methods Softw. (2020). https:\/\/doi.org\/10.1080\/10556788.2020.1725751","journal-title":"Optim. Methods Softw."},{"issue":"311","key":"196_CR7","doi-asserted-by":"publisher","first-page":"1307","DOI":"10.1090\/mcom\/3246","volume":"87","author":"GE Birgin","year":"2018","unstructured":"Birgin, G.E., Kreji\u0107, N., Mart\u00ednez, J.M.: On the employment of inexact restoration for the minimization of functions whose evaluation is subject to programming errors. Math. Comput. 87(311), 1307\u20131326 (2018)","journal-title":"Math. Comput."},{"key":"196_CR8","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1090\/mcom\/3445","volume":"89","author":"GE Birgin","year":"2020","unstructured":"Birgin, G.E., Kreji\u0107, N., Mart\u00ednez, J.M.: Iteration and evaluation complexity on the minimization of functions whose computation is intrinsically inexact. Math. Comput. 89, 253\u2013278 (2020)","journal-title":"Math. Comput."},{"issue":"2","key":"196_CR9","first-page":"92","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 supermartingales. Inf. J. Optim. 1(2), 92\u2013119 (2019)","journal-title":"Inf. J. Optim."},{"issue":"20","key":"196_CR10","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1093\/imanum\/dry009","volume":"39","author":"R Bollapragada","year":"2019","unstructured":"Bollapragada, R., Byrd, R., Nocedal, J.: Exact and inexact subsampled Newton methods for optimization. IMA J. Numer. Anal. 39(20), 545\u2013578 (2019)","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"196_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.C., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"issue":"2","key":"196_CR12","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1137\/140954362","volume":"26","author":"RH Byrd","year":"2016","unstructured":"Byrd, R.H., Hansen, S.L., Nocedal, J., Singer, Y.: A stochastic quasi-Newton method for large-scale optimization. SIAM J. Optim. 26(2), 1008\u20131021 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"196_CR13","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":"196_CR14","unstructured":"Causality workbench team. A marketing dataset (2008). http:\/\/www.causality.inf.ethz.ch\/data\/CINA.html"},{"key":"196_CR15","doi-asserted-by":"publisher","first-page":"27:1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2, 27:1\u201327:27 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"196_CR16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods. SMPS\/SIAM Series on Optimization","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. SMPS\/SIAM Series on Optimization. SIAM, Philadelphia (2000)"},{"issue":"1\u20132","key":"196_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s10107-007-0164-y","volume":"117","author":"G Deng","year":"2009","unstructured":"Deng, G., Ferris, M.C.: Variable-number sample path optimization. Math. Program. 117(1\u20132), 81\u2013109 (2009)","journal-title":"Math. Program."},{"key":"196_CR18","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"JE Dennis","year":"1983","unstructured":"Dennis, J.E., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice Hall, Englewood Cliffs (1983)"},{"key":"196_CR19","unstructured":"Erdogdu, M.A., Montanari, A.: Convergence rates of sub-sampled Newton methods. In: NIPS\u201915 Proceedings of the 28th International Conference on Neural Information Processing Systems, vol. 2, pp. 3052\u20133060 (2015)"},{"issue":"3","key":"196_CR20","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":"196_CR21","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-014-0794-9","volume":"152","author":"GN Grapiglia","year":"2015","unstructured":"Grapiglia, G.N., Yuan, J., Yuan, Y.: On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization. Math. Program. Ser. A 152, 491\u2013520 (2015)","journal-title":"Math. Program. Ser. A"},{"key":"196_CR22","doi-asserted-by":"crossref","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. In: Proceedings of the IEEE, vol. 86, no. 11, pp. 2278\u20132324 (1998). MNIST database available at http:\/\/yann.lecun.com\/exdb\/mnist\/","DOI":"10.1109\/5.726791"},{"key":"196_CR23","unstructured":"Lichman, M.: UCI machine learning repository (2013). https:\/\/archive.ics.uci.edu\/ml\/index.php. Accessed 15 Nov 2018"},{"key":"196_CR24","unstructured":"Liu, L., Liu, X., Hsieh, C.-J., Tao, D.: Stochastic second-order methods for non-convex optimization with inexact Hessian and gradient (2018). arXiv:1809.09853"},{"key":"196_CR25","doi-asserted-by":"publisher","first-page":"1775","DOI":"10.1090\/mcom\/3025","volume":"85","author":"N Kreji\u0107","year":"2016","unstructured":"Kreji\u0107, N., Mart\u00ednez, J.M.: Inexact restoration approach for minimization with inexact evaluation of the objective function. Math. Comput. 85, 1775\u20131791 (2016)","journal-title":"Math. Comput."},{"key":"196_CR26","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.cam.2012.12.020","volume":"245","author":"N Kreji\u0107","year":"2013","unstructured":"Kreji\u0107, N., Krklec, N.: Line search methods with variable sample size for unconstrained optimization. J. Comput. Appl. Math. 245, 213\u2013231 (2013)","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"196_CR27","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s11075-014-9869-1","volume":"68","author":"N Kreji\u0107","year":"2015","unstructured":"Kreji\u0107, N., Krklec, Jerinki\u0107 N.: Nonmonotone line search methods with variable sample size. Numer. Algorithms 68(4), 711\u2013739 (2015)","journal-title":"Numer. Algorithms"},{"key":"196_CR28","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/A:1017567113614","volume":"111","author":"JM Mart\u00ednez","year":"2001","unstructured":"Mart\u00ednez, J.M.: Inexact restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming. J. Optim. Theory Appl. 111, 39\u201358 (2001)","journal-title":"J. Optim. Theory Appl."},{"key":"196_CR29","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1023\/A:1004632923654","volume":"104","author":"JM Mart\u00ednez","year":"2000","unstructured":"Mart\u00ednez, J.M., Pilotta, E.A.: Inexact restoration algorithms for constrained optimization. J. Optim. Theory Appl. 104, 135\u2013163 (2000)","journal-title":"J. Optim. Theory Appl."},{"key":"196_CR30","volume-title":"Numerical Optimization. Springer Series in Operations Research","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer Series in Operations Research. Springer, Berlin (1999)"},{"issue":"4","key":"196_CR31","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1287\/opre.1090.0773","volume":"58","author":"R Pasupathy","year":"2010","unstructured":"Pasupathy, R.: On choosing parameters in retrospective-approximation algorithms for stochastic root finding and simulation optimization. Oper. Res. 58(4), 889\u2013901 (2010)","journal-title":"Oper. Res."},{"issue":"1","key":"196_CR32","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1137\/15M1021106","volume":"27","author":"M Pilanci","year":"2017","unstructured":"Pilanci, M., Wainwright, M.J.: Newton sketch: a near linear-time optimization algorithm with linear-quadratic convergence. SIAM J. Optim. 27(1), 205\u2013245 (2017)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"196_CR33","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.cam.2007.02.014","volume":"217","author":"E Polak","year":"2008","unstructured":"Polak, E., Royset, J.O.: Efficient sample sizes in stochastic nonlinear programing. J. Comput. Appl. Math. 217(2), 301\u2013310 (2008)","journal-title":"J. Comput. Appl. Math."},{"key":"196_CR34","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10107-018-1346-5","volume":"174","author":"F Roosta-Khorasani","year":"2019","unstructured":"Roosta-Khorasani, F., Mahoney, M.W.: Sub-sampled Newton methods. Math. Program. 174, 293\u2013326 (2019)","journal-title":"Math. Program."},{"issue":"NIPS","key":"196_CR35","first-page":"2530","volume":"30","author":"P Xu","year":"2016","unstructured":"Xu, P., Yang, J., Roosta-Khorasani, F., R\u00e9, C., Mahoney, M.W.: Sub-sampled Newton methods with non-uniform sampling. Adv. Neural Inf. Process. Syst. 30(NIPS), 2530\u20132538 (2016)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"196_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01405-z","author":"P Xu","year":"2019","unstructured":"Xu, P., Roosta-Khorasani, F., Mahoney, M.W.: Newton-type methods for non-convex optimization under inexact Hessian information. Math. Program. (2019). https:\/\/doi.org\/10.1007\/s10107-019-01405-z","journal-title":"Math. Program."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00196-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-020-00196-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00196-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,8]],"date-time":"2021-06-08T23:46:18Z","timestamp":1623195978000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-020-00196-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,9]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["196"],"URL":"https:\/\/doi.org\/10.1007\/s10589-020-00196-w","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,9]]},"assertion":[{"value":"31 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}