{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T22:14:04Z","timestamp":1773267244508,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,5,18]],"date-time":"2022-05-18T00:00:00Z","timestamp":1652832000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,18]],"date-time":"2022-05-18T00:00:00Z","timestamp":1652832000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["312777\/2020-5"],"award-info":[{"award-number":["312777\/2020-5"]}],"id":[{"id":"10.13039\/501100003593","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":[[2023,7]]},"DOI":"10.1007\/s10589-022-00373-z","type":"journal-article","created":{"date-parts":[[2022,5,18]],"date-time":"2022-05-18T11:02:55Z","timestamp":1652871775000},"page":"683-703","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Quadratic regularization methods with finite-difference gradient approximations"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3284-3371","authenticated-orcid":false,"given":"Geovani Nunes","family":"Grapiglia","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,18]]},"reference":[{"key":"373_CR1","doi-asserted-by":"crossref","unstructured":"Larson, J., Menickelly, M., Wild, S.M.: Derivative-free optimization. Acta Numer., pp 287\u2013404 (2019)","DOI":"10.1017\/S0962492919000060"},{"key":"373_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s13675-012-0003-7","volume":"1","author":"LN Vicente","year":"2013","unstructured":"Vicente, L.N.: Worst case complexity of direct search. EURO J. Comput. Optim. 1, 143\u2013153 (2013)","journal-title":"EURO J. Comput. Optim."},{"key":"373_CR3","unstructured":"Konecny, J., Richt\u00e1rik, P.: Simple complexity analysis of simplified direct search. arXiv:1410.0390 [math.OC] (2014)"},{"key":"373_CR4","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/s11590-015-0908-1","volume":"10","author":"M Dodangeh","year":"2016","unstructured":"Dodangeh, M., Vicente, L.N., Zhang, Z.: On the optimal order of worst case complexity of direct search. Optim. Lett. 10, 699\u2013708 (2016)","journal-title":"Optim. Lett."},{"key":"373_CR5","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s40314-014-0201-4","volume":"35","author":"GN Grapiglia","year":"2016","unstructured":"Grapiglia, G.N., Yuan, J., Yuan, Y.: A derivative-free trust-region algorithm for composite nonsmooth optimization. Comput. Appl. Math. 35, 475\u2013499 (2016)","journal-title":"Comput. Appl. Math."},{"key":"373_CR6","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1137\/151005683","volume":"26","author":"R Garmanjani","year":"2016","unstructured":"Garmanjani, R., J\u00fadice, D., Vicente, L.N.: Trust-region methods without using derivatives: worst-case complexity and the non-smooth case. SIAM J. Optim. 26, 1987\u20132011 (2016)","journal-title":"SIAM J. Optim."},{"key":"373_CR7","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, 527\u2013566 (2017)","journal-title":"Found. Comput. Math."},{"key":"373_CR8","doi-asserted-by":"publisher","first-page":"2726","DOI":"10.1137\/19M1244378","volume":"30","author":"EH Bergou","year":"2020","unstructured":"Bergou, E.H., Gorbunov, E., Richt\u00e1rik, P.: Stochastic three points method for unconstrained smooth minimization. SIAM J. Optim. 30, 2726\u20132749 (2020)","journal-title":"SIAM J. Optim."},{"key":"373_CR9","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1137\/140961602","volume":"25","author":"S Gratton","year":"2015","unstructured":"Gratton, S., Royer, C.W., Vicente, L.N., Zhang, Z.: Direct search based on probabilistic descent. SIAM J. Optim. 25, 1515\u20131541 (2015)","journal-title":"SIAM J. Optim."},{"key":"373_CR10","doi-asserted-by":"crossref","unstructured":"Kimiaei, M., Neumaier, A.: Efficient global unconstrained black box optimization. Optimization Online (2021)","DOI":"10.1007\/s12532-021-00215-9"},{"key":"373_CR11","doi-asserted-by":"crossref","unstructured":"Cartis, C., Roberts, L.: Scalable subspace methods for derivative-free nonlinear least-squares optimization. arXiv:2102.12016 [math.OC] (2021)","DOI":"10.1007\/s10107-022-01836-1"},{"key":"373_CR12","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, Berlin (2006)","edition":"2"},{"key":"373_CR13","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s11075-021-01200-y","volume":"90","author":"GN Grapiglia","year":"2022","unstructured":"Grapiglia, G.N., Gon\u00e7alves, M.L.N., Silva, G.N.: A cubic regularization of Newton\u2019s method with finite-difference Hessian approximations. Numer. Algorithms 90, 607\u2013630 (2022)","journal-title":"Numer. Algorithms"},{"key":"373_CR14","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1137\/100812276","volume":"22","author":"C Cartis","year":"2012","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization. SIAM J. Optim. 22, 66\u201386 (2012)","journal-title":"SIAM J. Optim."},{"key":"373_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10107-009-0286-5","volume":"127","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Adaptive cubic regularisation methods for unconstrained optimization: Part I: motivation, convergence and numerical results. Math. Progr. 127, 245\u2013295 (2011)","journal-title":"Math. Progr."},{"key":"373_CR16","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 17\u201341 (1981)","journal-title":"ACM Trans. Math. Softw."},{"key":"373_CR17","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder, J.A., Mead, R.: A simplex method for function minimization. Comput. J. 7, 308\u2013313 (1965)","journal-title":"Comput. J."},{"key":"373_CR18","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10589-017-9928-3","volume":"68","author":"GN Grapiglia","year":"2017","unstructured":"Grapiglia, G.N., Sachs, E.W.: On the worst-case evaluation complexity of non-monotone line search algorithms. Comput. Optim. Appl. 68, 555\u2013577 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"373_CR19","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":"373_CR20","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":"373_CR21","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10208-021-09513-z","volume":"22","author":"AS Berahas","year":"2021","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. 22, 507\u2013560 (2021)","journal-title":"Found. Comput. Math."},{"key":"373_CR22","doi-asserted-by":"crossref","unstructured":"Berahas, A.S., Sohab, O., Vicente, L.N.: Full-low evaluation methods for derivative-free optimization. arXiv:2107.11908 [math.OC] (2021)","DOI":"10.1080\/10556788.2022.2142582"},{"key":"373_CR23","unstructured":"Shi, H-J.M., Xuan, M.Q., Oztoprak, F., Nocedal, J.: On the numerical performance of derivative-free optimization methods based on finite-difference approximations. arXiv:2102.09762 [math.OC] (2021)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00373-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00373-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00373-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T16:53:25Z","timestamp":1688489605000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00373-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,18]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["373"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00373-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,18]]},"assertion":[{"value":"2 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}