{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T16:00:27Z","timestamp":1781798427357,"version":"3.54.5"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:00:00Z","timestamp":1732665600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:00:00Z","timestamp":1732665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"NSERC Canada Discovery Grant","award":["2020-04448"],"award-info":[{"award-number":["2020-04448"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s11590-024-02165-2","type":"journal-article","created":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T19:02:20Z","timestamp":1732734140000},"page":"211-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Convergence towards a local minimum by direct search methods with a covering step"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3043-5393","authenticated-orcid":false,"given":"Charles","family":"Audet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6560-8453","authenticated-orcid":false,"given":"Pierre-Yves","family":"Bouchet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lo\u00efc","family":"Bourdin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,11,27]]},"reference":[{"issue":"2","key":"2165_CR1","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1137\/080716980","volume":"20","author":"MA Abramson","year":"2009","unstructured":"Abramson, M.A., Audet, C., Dennis, J.E., Jr., Le Digabel, S.: OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions. SIAM J. Optim. 20(2), 948\u2013966 (2009)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2165_CR2","doi-asserted-by":"publisher","first-page":"1843","DOI":"10.1137\/21M1420915","volume":"32","author":"C Audet","year":"2022","unstructured":"Audet, C., Batailly, A., Kojtych, S.: Escaping unknown discontinuous regions in blackbox optimization. SIAM J. Optim. 32(3), 1843\u20131870 (2022)","journal-title":"SIAM J. Optim."},{"key":"2165_CR3","doi-asserted-by":"publisher","unstructured":"Audet, C., Bouchet, P.-Y., Bourdin, L.: Counterexample and an additional revealing poll step for a result of \u201canalysis of direct searches for discontinuous functions\u201d. Math. Program. 208, 411\u2013424 (2024). https:\/\/doi.org\/10.1007\/s10107-023-02042-3","DOI":"10.1007\/s10107-023-02042-3"},{"issue":"3","key":"2165_CR4","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/S1052623400378742","volume":"13","author":"C Audet","year":"2003","unstructured":"Audet, C., Dennis, J.E., Jr.: Analysis of generalized pattern searches. SIAM J. Optim. 13(3), 889\u2013903 (2003)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2165_CR5","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/040603371","volume":"17","author":"C Audet","year":"2006","unstructured":"Audet, C., Dennis, J.E., Jr.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17(1), 188\u2013217 (2006)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2165_CR6","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1137\/070692662","volume":"20","author":"C Audet","year":"2009","unstructured":"Audet, C., Dennis, J.E., Jr.: A progressive barrier for derivative-free nonlinear programming. SIAM J. Optim. 20(1), 445\u2013472 (2009)","journal-title":"SIAM J. Optim."},{"key":"2165_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68913-5","volume-title":"Derivative-Free and Blackbox Optimization. Springer Series in Operations Research and Financial Engineering","author":"C Audet","year":"2017","unstructured":"Audet, C., Hare, W.: Derivative-Free and Blackbox Optimization. Springer Series in Operations Research and Financial Engineering. Springer, Cham, Switzerland (2017)"},{"key":"2165_CR8","doi-asserted-by":"crossref","unstructured":"Audet, C., Hare, W.: Model-based methods in derivative-free nonsmooth optimization. In: Numerical nonsmooth optimization, chapter 15. Springer, (2020)","DOI":"10.1007\/978-3-030-34910-3_19"},{"key":"2165_CR9","doi-asserted-by":"crossref","unstructured":"Barkalov, K., Usova, M.: A search algorithm for the global extremum of a discontinuous function. In: Advances in Optimization and Applications, pp. 37\u201349, Cham, 2021. Springer","DOI":"10.1007\/978-3-030-92711-0_3"},{"issue":"2","key":"2165_CR10","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":"2165_CR11","unstructured":"Bouchet, P.-Y.: Th\u00e9orie de l\u2019optimisation sans d\u00e9riv\u00e9es dans le cas discontinu. PhD thesis, Polytechnique Montr\u00e9al, december (2023)"},{"issue":"3","key":"2165_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF01581171","volume":"80","author":"AR Conn","year":"1998","unstructured":"Conn, A.R., Mongeau, M.: Discontinuous piecewise linear optimization. Math. Program. 80(3), 315\u2013380 (1998)","journal-title":"Math. Program."},{"key":"2165_CR13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to Derivative-Free Optimization. MOS-SIAM Series on Optimization","author":"AR Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization. MOS-SIAM Series on Optimization. SIAM, Philadelphia (2009)"},{"issue":"1","key":"2165_CR14","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/BF01386213","volume":"2","author":"JH Halton","year":"1960","unstructured":"Halton, J.H.: On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. Numer. Math. 2(1), 84\u201390 (1960)","journal-title":"Numer. Math."},{"key":"2165_CR15","doi-asserted-by":"crossref","unstructured":"Kvasov, D.E., Sergeyev, Y.D.: Lipschitz Expensive Global Optimization, pp. 1\u201318. Springer International Publishing, Cham, (2020)","DOI":"10.1007\/978-3-030-54621-2_764-1"},{"key":"2165_CR16","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."},{"issue":"2","key":"2165_CR17","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.1007\/s11081-023-09839-3","volume":"25","author":"S Le Digabel","year":"2024","unstructured":"Le Digabel, S., Wild, S.M.: A taxonomy of constraints in black-box simulation-based optimization. Optim. Eng. 25(2), 1125\u20131143 (2024)","journal-title":"Optim. Eng."},{"key":"2165_CR18","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1080\/00029890.1963.11990039","volume":"70","author":"N Levine","year":"1963","unstructured":"Levine, N.: Semi-open sets and semi-continuity in topological spaces. Amer. Math. Monthly 70, 36\u201341 (1963)","journal-title":"Amer. Math. Monthly"},{"key":"2165_CR19","doi-asserted-by":"crossref","unstructured":"Meijster, A., Roerdink, J.B.T.N., Hesselink, W.H.: A General Algorithm for Computing Distance Transforms in Linear Time, pp. 331\u2013340. Springer US, Boston, MA, (2000)","DOI":"10.1007\/0-306-47025-X_36"},{"issue":"4","key":"2165_CR20","doi-asserted-by":"publisher","first-page":"3057","DOI":"10.1137\/22M1488569","volume":"33","author":"L Roberts","year":"2023","unstructured":"Roberts, L., Royer, C.W.: Direct search based on probabilistic descent in reduced spaces. SIAM J. Optim. 33(4), 3057\u20133082 (2023)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2165_CR21","first-page":"257","volume":"32","author":"RT Rockafellar","year":"1980","unstructured":"Rockafellar, R.T.: Generalized directional derivatives and subgradients of nonconvex functions. Canadian Journal of Mathematics. J. Canadien de Math\u00e9matiques 32(2), 257\u2013280 (1980)","journal-title":"J. Canadien de Math\u00e9matiques"},{"key":"2165_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-7199-2","volume-title":"Deterministic Global Optimization. Springer Briefs in Optimization","author":"YD Sergeyev","year":"2017","unstructured":"Sergeyev, Y.D., Kvasov, D.E.: Deterministic Global Optimization. Springer Briefs in Optimization. Springer, New York (2017)"},{"key":"2165_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-46537-6","volume-title":"Derivative-free DIRECT-type Global Optimization. Springer Briefs in Optimization","author":"L Stripinis","year":"2023","unstructured":"Stripinis, L., Paulavi\u010dius, R.: Derivative-free DIRECT-type Global Optimization. Springer Briefs in Optimization. Springer, Cham, Switzerland (2023)"},{"key":"2165_CR24","volume-title":"Global Optimization with Non-Convex Constraints. Nonconvex Optimization and Its Applications","author":"RG Strongin","year":"2013","unstructured":"Strongin, R.G., Sergeyev, Y.D.: Global Optimization with Non-Convex Constraints. Nonconvex Optimization and Its Applications. Springer, New York (2013)"},{"issue":"1\u20132","key":"2165_CR25","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10107-010-0429-8","volume":"133","author":"LN Vicente","year":"2012","unstructured":"Vicente, L.N., Cust\u00f3dio, A.L.: Analysis of direct searches for discontinuous functions. Math. Program. 133(1\u20132), 299\u2013325 (2012)","journal-title":"Math. Program."},{"key":"2165_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10898-013-0060-3","volume":"58","author":"A Wechsung","year":"2014","unstructured":"Wechsung, A., Barton, P.I.: Global optimization of bounded factorable functions with discontinuities. J. Global Optim. 58, 1\u201330 (2014)","journal-title":"J. Global Optim."},{"issue":"3","key":"2165_CR27","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10898-020-00923-x","volume":"78","author":"D Zhan","year":"2020","unstructured":"Zhan, D., Xing, H.: Expected improvement for expensive optimization: a review. J. Global Optim. 78(3), 507\u2013544 (2020)","journal-title":"J. Global Optim."},{"key":"2165_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64712-4","volume-title":"Bayesian and High-Dimensional Global Optimization. Springer Briefs in Optimization","author":"A Zhigljavsky","year":"2021","unstructured":"Zhigljavsky, A., \u017dilinskas, A.: Bayesian and High-Dimensional Global Optimization. Springer Briefs in Optimization. Springer, Cham (2021)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02165-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-024-02165-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02165-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T10:04:02Z","timestamp":1736935442000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-024-02165-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,27]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["2165"],"URL":"https:\/\/doi.org\/10.1007\/s11590-024-02165-2","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,27]]},"assertion":[{"value":"27 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}