{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T02:10:20Z","timestamp":1773281420757,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T00:00:00Z","timestamp":1766275200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T00:00:00Z","timestamp":1766275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-19-P3IA-0001"],"award-info":[{"award-number":["ANR-19-P3IA-0001"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-24-1-2638"],"award-info":[{"award-number":["N00014-24-1-2638"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-24-1-2638"],"award-info":[{"award-number":["N00014-24-1-2638"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009879","name":"FACE Foundation","doi-asserted-by":"publisher","award":["Thomas Jefferson Fund ALIAS"],"award-info":[{"award-number":["Thomas Jefferson Fund ALIAS"]}],"id":[{"id":"10.13039\/100009879","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009879","name":"FACE Foundation","doi-asserted-by":"publisher","award":["Thomas Jefferson Fund ALIAS"],"award-info":[{"award-number":["Thomas Jefferson Fund ALIAS"]}],"id":[{"id":"10.13039\/100009879","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s10589-025-00753-1","type":"journal-article","created":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T08:32:57Z","timestamp":1766305977000},"page":"899-920","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A line search framework with restarting for noisy optimization problems"],"prefix":"10.1007","volume":"93","author":[{"given":"Albert S.","family":"Berahas","sequence":"first","affiliation":[]},{"given":"Michael J.","family":"O\u2019Neill","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2452-2172","authenticated-orcid":false,"given":"Cl\u00e9ment W.","family":"Royer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,21]]},"reference":[{"key":"753_CR1","doi-asserted-by":"crossref","unstructured":"Audet, C., Hare, W.: Derivative-Free and Blackbox Optimization. Springer Series in Operations Research and Financial Engineering. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-68913-5"},{"key":"753_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, 965\u2013993 (2019)","journal-title":"SIAM J. Optim."},{"key":"753_CR3","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, 1489\u20131518 (2021)","journal-title":"SIAM J. Optim."},{"key":"753_CR4","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1080\/10556788.2025.2475406","volume":"40","author":"E Berglund","year":"2025","unstructured":"Berglund, E., Zhang, J., Johansson, M.: Soft quasi-Newton: guaranteed positive definiteness by relaxing the secant constraint. Optim. Methods Softw. 40, 783\u2013812 (2025)","journal-title":"Optim. Methods Softw."},{"key":"753_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, 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"key":"753_CR6","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, 127\u2013155 (2012)","journal-title":"Math. Program."},{"key":"753_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10107-023-01999-5","volume":"207","author":"L Cao","year":"2024","unstructured":"Cao, L., Berahas, A.S., Scheinberg, K.: First-and second-order high probability complexity bounds for trust-region methods with noisy oracles. Math. Program. 207, 55\u2013106 (2024)","journal-title":"Math. Program."},{"key":"753_CR8","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: \u201cConvex until proven guilty\": dimension-free acceleration of gradient descent on non-convex functions. In: Proceedings of the International Conference on Machine Learning, August 2017, Sydney, Australia, pp. 654\u2013663 (2017)"},{"key":"753_CR9","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, 251\u2013265 (1991)","journal-title":"SIAM J. Numer. Anal."},{"key":"753_CR10","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1080\/02331934.2013.869809","volume":"64","author":"C Cartis","year":"2015","unstructured":"Cartis, C., Sampaio, P.R., Toint, P.L.: Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization. Optimization 64, 1349\u20131361 (2015)","journal-title":"Optimization"},{"key":"753_CR11","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, 337\u2013375 (2018)","journal-title":"Math. Program."},{"key":"753_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2022.100044","volume":"10","author":"R Chan-Renous-Legoubin","year":"2022","unstructured":"Chan-Renous-Legoubin, R., Royer, C.W.: A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression. Euro. J. Comput. Optim. 10, 100044 (2022)","journal-title":"Euro. J. Comput. Optim."},{"key":"753_CR13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to Derivative-Free Optimization","author":"AR Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization. SIAM, Philadelphia (2009)"},{"key":"753_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"753_CR15","doi-asserted-by":"publisher","first-page":"2788","DOI":"10.1109\/TIT.2015.2409256","volume":"61","author":"JC Duchi","year":"2015","unstructured":"Duchi, J.C., Jordan, M.I., Wainwright, M.J., Wibisono, A.: Optimal rates for zero-order convex optimization: The power of two function evaluations. IEEE Trans. Inf. Theory 61, 2788\u20132806 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"753_CR16","unstructured":"Fazel, M., Ge, R., Kakade, S., Mesbahi, M.: Global convergence of policy gradient methods for the linear quadratic regulator. In: International Conference on Machine Learning, pp. 1467\u20131476. PMLR (2018)"},{"key":"753_CR17","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NIM Gould","year":"2015","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEst: a constrained and unconstrained testing environment with safe threads. Comput. Optim. Appl. 60, 545\u2013557 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"753_CR18","doi-asserted-by":"crossref","unstructured":"Gratton, S., Toint, Ph.L.: S2MPJ and CUTEst optimization problems for Matlab, Python and Julia (2024). arXiv:2407.07812","DOI":"10.1080\/10556788.2025.2490640"},{"key":"753_CR19","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1080\/1055678042000208570","volume":"20","author":"L Grippo","year":"2005","unstructured":"Grippo, L., Lucidi, S.: Convergence conditions, line search algorithms and trust region implementations for the Polak-Ribi\u00e8re conjugate gradient method. Optim. Methods Softw. 20, 71\u201398 (2005)","journal-title":"Optim. Methods Softw."},{"key":"753_CR20","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"WW Hager","year":"2005","unstructured":"Hager, W.W., Zhang, H.: A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16, 170\u2013192 (2005)","journal-title":"SIAM J. Optim."},{"key":"753_CR21","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/1132973.1132979","volume":"32","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: Algorithm 851: CG_DESCENT, a conjugate gradient method with guaranteed descent. ACM Trans. Math. Software 32, 113\u2013137 (2006)","journal-title":"ACM Trans. Math. Software"},{"key":"753_CR22","first-page":"35","volume":"2","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: A survey of nonlinear conjugate gradient methods. Pac. J. Optim. 2, 35\u201358 (2006)","journal-title":"Pac. J. Optim."},{"key":"753_CR23","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/s10589-022-00448-x","volume":"84","author":"B Irwin","year":"2023","unstructured":"Irwin, B., Haber, E.: Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition. Comput. Optim. Appl. 84, 651\u2013702 (2023)","journal-title":"Comput. Optim. Appl."},{"key":"753_CR24","doi-asserted-by":"publisher","first-page":"2411","DOI":"10.1137\/22M1512764","volume":"34","author":"B Jin","year":"2024","unstructured":"Jin, B., Scheinberg, K., Xie, M.: High probability complexity bounds for adaptive step search based on stochastic oracles. SIAM J. Optim. 34, 2411\u20132439 (2024)","journal-title":"SIAM J. Optim."},{"key":"753_CR25","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S0962492919000060","volume":"28","author":"J Larson","year":"2019","unstructured":"Larson, J., Menickelly, M., Wild, S.M.: Derivative-free optimization methods. Acta Numer 28, 287\u2013404 (2019)","journal-title":"Acta Numer"},{"key":"753_CR26","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"JJ Mor\u00e9","year":"2009","unstructured":"Mor\u00e9, J.J., Wild, S.M.: Benchmarking derivative-free optimization algorithms. SIAM J. Optim. 20, 172\u2013191 (2009)","journal-title":"SIAM J. Optim."},{"key":"753_CR27","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. The Springer Series in Operations Research and Financial Engineering. Springer, New York (2006)"},{"key":"753_CR28","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 convergence rate analysis. SIAM J. Optim. 30, 349\u2013376 (2020)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"753_CR29","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":"4","key":"753_CR30","doi-asserted-by":"publisher","first-page":"3145","DOI":"10.1137\/15M1042425","volume":"28","author":"S Shashaani","year":"2018","unstructured":"Shashaani, S., Hashemi, F.S., Pasupathy, R.: Astro-df: A class of adaptive sampling trust-region algorithms for derivative-free stochastic optimization. SIAM J. Optim. 28(4), 3145\u20133176 (2018)","journal-title":"SIAM J. Optim."},{"key":"753_CR31","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1137\/20M1373190","volume":"32","author":"H-JM Shi","year":"2022","unstructured":"Shi, H.-J.M., Xie, Y., Byrd, R.H., Nocedal, J.: A noise-tolerant quasi-Newton algorithm for unconstrained optimization. SIAM J. Optim. 32, 29\u201355 (2022)","journal-title":"SIAM J. Optim."},{"key":"753_CR32","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s10107-023-01941-9","volume":"202","author":"S Sun","year":"2023","unstructured":"Sun, S., Nocedal, J.: A trust region method for noisy unconstrained optimization. Math. Program. 202, 445\u2013472 (2023)","journal-title":"Math. Program."},{"key":"753_CR33","doi-asserted-by":"publisher","DOI":"10.1017\/9781009004282","volume-title":"Optimization for Data Analysis","author":"SJ Wright","year":"2022","unstructured":"Wright, S.J., Recht, B.: Optimization for Data Analysis. Cambridge University Press, Cambridge (2022)"},{"key":"753_CR34","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, 182\u2013209 (2020)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00753-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00753-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00753-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T11:17:33Z","timestamp":1773227853000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00753-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,21]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["753"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00753-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,21]]},"assertion":[{"value":"4 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}