{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T09:54:11Z","timestamp":1756461251017,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T00:00:00Z","timestamp":1614384000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T00:00:00Z","timestamp":1614384000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003130","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":[[2021,5]]},"DOI":"10.1007\/s10589-021-00267-6","type":"journal-article","created":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T05:37:35Z","timestamp":1614404255000},"page":"35-65","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Generating set search using simplex gradients for bound-constrained black-box optimization"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3792-5635","authenticated-orcid":false,"given":"Sander","family":"Dedoncker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wim","family":"Desmet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Naets","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,27]]},"reference":[{"issue":"2","key":"267_CR1","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1137\/04060367X","volume":"16","author":"MA Abramson","year":"2005","unstructured":"Abramson, M.A.: Second-order behavior of pattern search. SIAM J. Optim. 16(2), 515\u2013530 (2005)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"267_CR2","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1137\/050638382","volume":"17","author":"MA Abramson","year":"2006","unstructured":"Abramson, M.A., Audet, C.: Convergence of mesh adaptive direct search to second-order stationary points. SIAM J. Optim. 17(2), 606\u2013619 (2006)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"267_CR3","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1080\/10556780701521670","volume":"23","author":"MA Abramson","year":"2008","unstructured":"Abramson, M.A., Brezhneva, O.A., Dennis, J.E., Pingel, R.L.: Pattern search in the presence of degenerate linear constraints. Optim. Methods Softw. 23(3), 297\u2013319 (2008)","journal-title":"Optim. Methods Softw."},{"issue":"5","key":"267_CR4","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1080\/10556788.2013.808198","volume":"29","author":"MA Abramson","year":"2014","unstructured":"Abramson, M.A., Frimannslund, L., Steihaug, T.: A subclass of generating set search with convergence to second-order stationary points. Optim. Methods Softw. 29(5), 900\u2013918 (2014)","journal-title":"Optim. Methods Softw."},{"key":"267_CR5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/978-1-4939-1124-0_2","volume-title":"Mathematics Without Boundaries","author":"C Audet","year":"2014","unstructured":"Audet, C.: A survey on direct search methods for blackbox optimization and their applications. In: Pardalos, P.M., Rassias, T.M. (eds.) Mathematics Without Boundaries, pp. 31\u201356. Springer, New York (2014)"},{"issue":"3","key":"267_CR6","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/S1052623400378742","volume":"13","author":"C Audet","year":"2003","unstructured":"Audet, C., Dennis, J.E.: Analysis of generalized pattern searches. SIAM J. Optim. 13(3), 889\u2013903 (2003)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"267_CR7","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/040603371","volume":"17","author":"C Audet","year":"2006","unstructured":"Audet, C., Dennis, J.E.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17(1), 188\u2013217 (2006)","journal-title":"SIAM J. Optim."},{"key":"267_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68913-5","volume-title":"Derivative-Free and Blackbox Optimization. Series in Operations Research and Financial Engineering","author":"C Audet","year":"2017","unstructured":"Audet, C., Hare, W.: Derivative-Free and Blackbox Optimization. Series in Operations Research and Financial Engineering, 1st edn. Springer, Cham (2017)","edition":"1"},{"issue":"2","key":"267_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s11081-015-9283-0","volume":"17","author":"C Audet","year":"2016","unstructured":"Audet, C., Le Digabel, S., Tribes, C.: Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization. Optim. Eng. 17(2), 333\u2013358 (2016)","journal-title":"Optim. Eng."},{"key":"267_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-1-4612-1780-0_5","volume-title":"Computational Methods for Optimal Design and Control","author":"DM Bortz","year":"1998","unstructured":"Bortz, D.M., Kelley, C.T.: The simplex gradient and noisy optimization problems. In: Borggaard, J., Burns, J., Cliff, E., Schreck, S. (eds.) Computational Methods for Optimal Design and Control, pp. 77\u201390. Birkh\u00e4user, Boston (1998)"},{"issue":"1","key":"267_CR11","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.laa.2005.07.021","volume":"415","author":"M Brand","year":"2006","unstructured":"Brand, M.: Fast low-rank modifications of the thin singular value decomposition. Linear Algebra Appl. 415(1), 20\u201330 (2006)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"267_CR12","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1093\/imanum\/drn046","volume":"28","author":"AR Conn","year":"2008","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation. IMA J. Numer. Anal. 28(4), 721\u2013748 (2008)","journal-title":"IMA J. Numer. Anal."},{"key":"267_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. Society for Industrial and Applied Mathematics, Philadelphia (2009)"},{"issue":"4","key":"267_CR14","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1093\/imanum\/drn045","volume":"28","author":"AL Cust\u00f3dio","year":"2008","unstructured":"Cust\u00f3dio, A.L., Dennis, J.E., Vicente, L.N.: Using simplex gradients of nonsmooth functions in direct search methods. IMA J. Numer. Anal. 28(4), 770\u2013784 (2008)","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"267_CR15","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s10589-009-9283-0","volume":"46","author":"AL Cust\u00f3dio","year":"2010","unstructured":"Cust\u00f3dio, A.L., Rocha, H., Vicente, L.N.: Incorporating minimum Frobenius norm models in direct search. Comput. Optim. Appl. 46(2), 265\u2013278 (2010)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"267_CR16","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1137\/050646706","volume":"18","author":"AL Cust\u00f3dio","year":"2007","unstructured":"Cust\u00f3dio, A.L., Vicente, L.N.: Using sampling and simplex derivatives in pattern search methods. SIAM J. Optim. 18(2), 537\u2013555 (2007)","journal-title":"SIAM J. Optim."},{"key":"267_CR17","unstructured":"Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: MHS\u201995. Proceedings of the Sixth International Symposium on Micro Machine and Human Science, pp. 39\u201343. IEEE (1995)"},{"key":"267_CR18","unstructured":"Fermi, E., Metropolis, N.: Numerical solution of a minimum problem. Technical report, Los Alamos National Laboratory, Los Alamos (1952)"},{"issue":"1","key":"267_CR19","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10589-007-9038-8","volume":"38","author":"L Frimannslund","year":"2007","unstructured":"Frimannslund, L., Steihaug, T.: A generating set search method using curvature information. Comput. Optim. Appl. 38(1), 105\u2013121 (2007)","journal-title":"Comput. Optim. Appl."},{"key":"267_CR20","first-page":"298","volume-title":"Activity Analysis of Production and Allocation, Chapter\u00a018","author":"M Gerstenhaber","year":"1951","unstructured":"Gerstenhaber, M.: Theory of convex polyhedral cones. In: Koopmans, T.C. (ed.) Activity Analysis of Production and Allocation, Chapter\u00a018, pp. 298\u2013316. Wiley, New York (1951)"},{"issue":"2","key":"267_CR21","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1137\/0805015","volume":"5","author":"P Gilmore","year":"1995","unstructured":"Gilmore, P., Kelley, C.T.: An implicit filtering algorithm for optimization of functions with many local minima. SIAM J. Optim. 5(2), 269\u2013285 (1995)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"267_CR22","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1080\/02331934.2015.1124271","volume":"65","author":"S Gratton","year":"2016","unstructured":"Gratton, S., Royer, C.W., Vicente, L.N.: A second-order globally convergent direct-search method and its worst-case complexity. Optimization 65(6), 1105\u20131128 (2016)","journal-title":"Optimization"},{"key":"267_CR23","volume-title":"Adaptation in Natural and Artificial Systems","author":"JH Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)"},{"issue":"2","key":"267_CR24","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1145\/321062.321069","volume":"8","author":"R Hooke","year":"1961","unstructured":"Hooke, R., Jeeves, T.A.: \u201cDirect search\u2019\u2019 solution of numerical and statistical problems. J. ACM 8(2), 212\u2013229 (1961)","journal-title":"J. ACM"},{"issue":"1","key":"267_CR25","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1137\/S1052623497315203","volume":"10","author":"CT Kelley","year":"1999","unstructured":"Kelley, C.T.: Detection and remediation of stagnation in the Nelder\u2013Mead algorithm using a sufficient decrease condition. SIAM J. Optim. 10(1), 43\u201355 (1999)","journal-title":"SIAM J. Optim."},{"key":"267_CR26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971903","volume-title":"Implicit Filtering","author":"CT Kelley","year":"2011","unstructured":"Kelley, C.T.: Implicit Filtering. Society for Industrial and Applied Mathematics, Philadelphia (2011)"},{"issue":"3","key":"267_CR27","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1137\/S003614450242889","volume":"45","author":"TG Kolda","year":"2003","unstructured":"Kolda, T.G., Lewis, R.M., Torczon, V.: Optimization by direct search: new perspectives on some classical and modern methods. SIAM Rev. 45(3), 385\u2013482 (2003)","journal-title":"SIAM Rev."},{"issue":"4","key":"267_CR28","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1137\/S1052623403433638","volume":"17","author":"TG Kolda","year":"2006","unstructured":"Kolda, T.G., Lewis, R.M., Torczon, V.: Stationarity results for generating set search for linearly constrained optimization. SIAM J. Optim. 17(4), 943\u2013968 (2006)","journal-title":"SIAM J. Optim."},{"key":"267_CR29","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":"6","key":"267_CR30","doi-asserted-by":"publisher","first-page":"2507","DOI":"10.1137\/050635432","volume":"29","author":"RM Lewis","year":"2007","unstructured":"Lewis, R.M., Shepherd, A., Torczon, V.: Implementing generating set search methods for linearly constrained minimization. SIAM J. Sci. Comput. 29(6), 2507\u20132530 (2007)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"267_CR31","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.1137\/S1052623496300507","volume":"9","author":"RM Lewis","year":"1999","unstructured":"Lewis, R.M., Torczon, V.: Pattern search algorithms for bound constrained minimization. SIAM J. Optim. 9(4), 1082\u20131099 (1999)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"267_CR32","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1137\/S1052623497331373","volume":"10","author":"RM Lewis","year":"2000","unstructured":"Lewis, R.M., Torczon, V.: Pattern search methods for linearly constrained minimization. SIAM J. Optim. 10(3), 917\u2013941 (2000)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"267_CR33","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s101070100266","volume":"92","author":"S Lucidi","year":"2002","unstructured":"Lucidi, S., Sciandrone, M., Tseng, P.: Objective-derivative-free methods for constrained optimization. Math. Program. 92(1), 37\u201359 (2002)","journal-title":"Math. Program."},{"issue":"1","key":"267_CR34","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(1), 172\u2013191 (2009)","journal-title":"SIAM J. Optim."},{"key":"267_CR35","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York (2006)","edition":"2"},{"issue":"1","key":"267_CR36","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1137\/0801010","volume":"1","author":"V Torczon","year":"1991","unstructured":"Torczon, V.: On the convergence of the multidirectional search algorithm. SIAM J. Optim. 1(1), 123\u2013145 (1991)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"267_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S1052623493250780","volume":"7","author":"V Torczon","year":"1997","unstructured":"Torczon, V.: On the convergence of pattern search algorithms. SIAM J. Optim. 7(1), 1\u201325 (1997)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"267_CR38","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1137\/S1052623495282857","volume":"10","author":"P Tseng","year":"1999","unstructured":"Tseng, P.: Fortified-descent simplicial search method: a general approach. SIAM J. Optim. 10(1), 269\u2013288 (1999)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"267_CR39","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."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00267-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-021-00267-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00267-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T04:04:46Z","timestamp":1697947486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-021-00267-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,27]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["267"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00267-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2021,2,27]]},"assertion":[{"value":"8 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}