{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T12:00:27Z","timestamp":1777118427011,"version":"3.51.4"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2023,3,24]],"date-time":"2023-03-24T00:00:00Z","timestamp":1679616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,24]],"date-time":"2023-03-24T00:00:00Z","timestamp":1679616000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1620022"],"award-info":[{"award-number":["DMS-1620022"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-21-1-2675"],"award-info":[{"award-number":["N00014-21-1-2675"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006831","name":"U.S. Air Force","doi-asserted-by":"publisher","award":["FA95502110084"],"award-info":[{"award-number":["FA95502110084"]}],"id":[{"id":"10.13039\/100006831","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10107-023-01941-9","type":"journal-article","created":{"date-parts":[[2023,3,24]],"date-time":"2023-03-24T18:02:48Z","timestamp":1679680968000},"page":"445-472","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["A trust region method for noisy unconstrained optimization"],"prefix":"10.1007","volume":"202","author":[{"given":"Shigeng","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9662-2730","authenticated-orcid":false,"given":"Jorge","family":"Nocedal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,24]]},"reference":[{"key":"1941_CR1","unstructured":"Bellavia, S., Gurioli, G., Morini, B., Toint, P.: The impact of noise on evaluation complexity: the deterministic trust-region case. arXiv preprint arXiv:2104.02519 (2021)"},{"issue":"2","key":"1941_CR2","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1137\/18M1177718","volume":"29","author":"AS Berahas","year":"2019","unstructured":"Berahas, A.S., Byrd, R.H., Nocedal, J.: Derivative-free optimization of noisy functions via quasi-Newton methods. SIAM J. Optim. 29(2), 965\u2013993 (2019)","journal-title":"SIAM J. Optim."},{"key":"1941_CR3","doi-asserted-by":"crossref","unstructured":"Berahas, A.S., Cao, L., Choromanski, K., Scheinberg, K.: A theoretical and empirical comparison of gradient approximations in derivative-free optimization. Found. Comput. Math. pp. 1\u201354 (2021)","DOI":"10.1007\/s10208-021-09513-z"},{"issue":"2","key":"1941_CR4","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."},{"key":"1941_CR5","doi-asserted-by":"crossref","unstructured":"Berahas, A.S., Curtis, F.E., O\u2019Neill, M.J., Robinson, D.P.: A stochastic sequential quadratic optimization algorithm for nonlinear equality constrained optimization with rank-deficient Jacobians. arXiv preprint arXiv:2106.13015 (2021)","DOI":"10.1137\/20M1354556"},{"issue":"2","key":"1941_CR6","doi-asserted-by":"publisher","first-page":"1352","DOI":"10.1137\/20M1354556","volume":"31","author":"AS Berahas","year":"2021","unstructured":"Berahas, A.S., Curtis, F.E., Robinson, D., Zhou, B.: Sequential quadratic optimization for nonlinear equality constrained stochastic optimization. SIAM J. Optim. 31(2), 1352\u20131379 (2021)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1941_CR7","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(2), 92\u2013119 (2019)","journal-title":"INFORMS J. Optim."},{"issue":"4","key":"1941_CR8","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":"1941_CR9","doi-asserted-by":"crossref","unstructured":"Bollapragada, R., Byrd, R.H., Nocedal, J.: Exact and inexact subsampled newton methods for optimization. IMA J. Numer. Anal. (2018)","DOI":"10.1093\/imanum\/dry009"},{"issue":"2","key":"1941_CR10","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."},{"issue":"1","key":"1941_CR11","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."},{"issue":"1","key":"1941_CR12","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1137\/0728014","volume":"28","author":"RG Carter","year":"1991","unstructured":"Carter, R.G.: On the global convergence of trust region algorithms using inexact gradient information. SIAM J. Numer. Anal. 28(1), 251\u2013265 (1991)","journal-title":"SIAM J. Numer. Anal."},{"key":"1941_CR13","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.: Strong evaluation complexity of an inexact trust-region algorithm with for arbitrary-order unconstrained nonconvex optimization. arXiv preprint arXiv:2001.10802 (2021)"},{"issue":"2","key":"1941_CR14","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10107-017-1137-4","volume":"169","author":"C Cartis","year":"2018","unstructured":"Cartis, C., Scheinberg, K.: Global convergence rate analysis of unconstrained optimization methods based on probabilistic models. Math. Program. 169(2), 337\u2013375 (2018)","journal-title":"Math. Program."},{"issue":"2","key":"1941_CR15","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":"1","key":"1941_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF02592099","volume":"73","author":"AR Conn","year":"1996","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Numerical experiments with the LANCELOT package (Release A) for large-scale nonlinear optimization. Math. Program. Ser. A 73(1), 73\u2013110 (1996)","journal-title":"Math. Program. Ser. A"},{"issue":"5","key":"1941_CR17","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/MSP.2020.3003539","volume":"37","author":"FE Curtis","year":"2020","unstructured":"Curtis, F.E., Scheinberg, K.: Adaptive stochastic optimization: a framework for analyzing stochastic optimization algorithms. IEEE Signal Process. Mag. 37(5), 32\u201342 (2020)","journal-title":"IEEE Signal Process. Mag."},{"issue":"3","key":"1941_CR18","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1287\/ijoo.2018.0010","volume":"1","author":"FE Curtis","year":"2019","unstructured":"Curtis, F.E., Scheinberg, K., Shi, R.: A stochastic trust region algorithm based on careful step normalization. INFORMS J. Optim. 1(3), 200\u2013220 (2019)","journal-title":"INFORMS J. Optim."},{"issue":"3","key":"1941_CR19","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\u2013stochastic methods for data fitting. SIAM J. Sci. Comput. 34(3), A1380\u2013A1405 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"1941_CR20","first-page":"9193","volume":"34","author":"B Jin","year":"2021","unstructured":"Jin, B., Scheinberg, K., Xie, M.: High probability complexity bounds for line search based on stochastic oracles. Adv. Neural Inf. Process. Syst. 34, 9193\u20139203 (2021)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"1941_CR21","doi-asserted-by":"crossref","unstructured":"Cao, L., Berahas, A.S., Scheinberg, K.: First-and second-order high probability complexity bounds for trust-region methods with noisy oracles. arXiv preprint arXiv:2205.03667 (2022)","DOI":"10.1007\/s10107-023-01999-5"},{"key":"1941_CR22","unstructured":"Micikevicius, P., Narang, S., Alben, J., Diamos, G., Elsen, E., Garcia, D., Ginsburg, B., Houston, M., Kuchaiev, O., Venkatesh, G., et\u00a0al.: Mixed precision training. arXiv preprint arXiv:1710.03740 (2017)"},{"issue":"3","key":"1941_CR23","doi-asserted-by":"publisher","first-page":"1292","DOI":"10.1137\/100786125","volume":"33","author":"JJ Mor\u00e9","year":"2011","unstructured":"Mor\u00e9, J.J., Wild, S.M.: Estimating computational noise. SIAM J. Sci. Comput. 33(3), 1292\u20131314 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"1941_CR24","doi-asserted-by":"crossref","unstructured":"Nedi\u0107, A., Bertsekas, D.: Convergence rate of incremental subgradient algorithms. In: Stochastic Optimization: Algorithms and Applications, pp. 223\u2013264. Springer (2001)","DOI":"10.1007\/978-1-4757-6594-6_11"},{"issue":"2","key":"1941_CR25","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10208-015-9296-2","volume":"17","author":"Y Nesterov","year":"2017","unstructured":"Nesterov, Y., Spokoiny, V.: Random gradient-free minimization of convex functions. Found. Comput. Math. 17(2), 527\u2013566 (2017)","journal-title":"Found. Comput. Math."},{"issue":"10","key":"1941_CR26","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1002\/nme.4761","volume":"100","author":"LW Ng","year":"2014","unstructured":"Ng, L.W., Willcox, K.E.: Multifidelity approaches for optimization under uncertainty. Int. J. Numer. Methods Eng. 100(10), 746\u2013772 (2014)","journal-title":"Int. J. Numer. Methods Eng."},{"key":"1941_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization, 2nd edn. Springer, New York (1999)","edition":"2"},{"key":"1941_CR28","unstructured":"\u00d6ztoprak, F., Byrd, R., Nocedal, J.: Constrained optimization in the presence of noise. arXiv preprint arXiv:2110.04355 (2021)"},{"key":"1941_CR29","unstructured":"Paquette, C., Scheinberg, K.: A stochastic line search method with convergence rate analysis. arXiv preprint arXiv:1807.07994 (2018)"},{"issue":"1","key":"1941_CR30","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1137\/140951679","volume":"28","author":"R Pasupathy","year":"2018","unstructured":"Pasupathy, R., Glynn, P., Ghosh, S., Hashemi, F.S.: On sampling rates in simulation-based recursions. SIAM J. Optim. 28(1), 45\u201373 (2018)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1941_CR31","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1137\/16M1082469","volume":"60","author":"B Peherstorfer","year":"2018","unstructured":"Peherstorfer, B., Willcox, K., Gunzburger, M.: Survey of multifidelity methods in uncertainty propagation, inference, and optimization. Siam Rev. 60(3), 550\u2013591 (2018)","journal-title":"Siam Rev."},{"key":"1941_CR32","first-page":"32","volume-title":"Introduction to Optimization. Optimization Software","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to Optimization. Optimization Software, vol. 1, p. 32. Inc., Publications Division, New York (1987)"},{"key":"1941_CR33","doi-asserted-by":"crossref","unstructured":"Schittkowski, K.: More Test Examples for Nonlinear Programming Codes. Lecture Notes in Economics and Mathematical Systems, vol. 282 (1987)","DOI":"10.1007\/978-3-642-61582-5"},{"key":"1941_CR34","doi-asserted-by":"crossref","unstructured":"Shi, H.J.M., Xie, Y., Xuan, M.Q., Nocedal, J.: Adaptive finite-difference interval estimation for noisy derivative-free optimization. arXiv preprint arXiv:2110.06380 (2021)","DOI":"10.1137\/21M1452470"},{"issue":"1","key":"1941_CR35","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1137\/19M1240794","volume":"30","author":"Y Xie","year":"2020","unstructured":"Xie, Y., Byrd, R.H., Nocedal, J.: Analysis of the BFGS method with errors. SIAM J. Optim. 30(1), 182\u2013209 (2020)","journal-title":"SIAM J. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-01941-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-023-01941-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-01941-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T19:54:02Z","timestamp":1697054042000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-023-01941-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,24]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1941"],"URL":"https:\/\/doi.org\/10.1007\/s10107-023-01941-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,24]]},"assertion":[{"value":"6 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}