{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:23Z","timestamp":1740122663431,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100006602","name":"Air Force Research Laboratory","doi-asserted-by":"publisher","award":["FA9550-23-1-0217"],"award-info":[{"award-number":["FA9550-23-1-0217"]}],"id":[{"id":"10.13039\/100006602","id-type":"DOI","asserted-by":"publisher"}]},{"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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s10589-024-00596-2","type":"journal-article","created":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T20:37:04Z","timestamp":1722544624000},"page":"279-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Full-low evaluation methods for bound and linearly constrained derivative-free optimization"],"prefix":"10.1007","volume":"89","author":[{"given":"C. W.","family":"Royer","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3633-5518","authenticated-orcid":false,"given":"O.","family":"Sohab","sequence":"additional","affiliation":[]},{"given":"L. N.","family":"Vicente","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,1]]},"reference":[{"key":"596_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2021.100011","volume":"9","author":"S Alarie","year":"2024","unstructured":"Alarie, S., Audet, C., Gheribi, A.E., Kokkolaras, M., Le Digabel, S.: Two decades of blackbox optimization applications. EURO J. Comput. Optim. 9, 100011 (2024)","journal-title":"EURO J. Comput. Optim."},{"key":"596_CR2","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, 445\u2013472 (2009)","journal-title":"SIAM J. Optim."},{"key":"596_CR3","series-title":"Springer Series in Operations Research and Financial Engineering","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68913-5","volume-title":"Derivative-Free and Blackbox Optimization","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 (2017)"},{"key":"596_CR4","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/S1052623400378742","volume":"13","author":"C Audet","year":"2002","unstructured":"Audet, C., Dennis, J.E., Jr.: Analysis of generalized pattern searches. SIAM J. Optim. 13, 889\u2013903 (2002)","journal-title":"SIAM J. Optim."},{"key":"596_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, 188\u2013217 (2006)","journal-title":"SIAM J. Optim."},{"unstructured":"Audet, C., Digabel, S.L., Montplaisir, V.R., Tribes, C.: Nomad version 4: nonlinear optimization with the mads algorithm (2021). arXiv preprint arXiv:2104.11627","key":"596_CR6"},{"key":"596_CR7","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/18M1217760","volume":"30","author":"A Beck","year":"2020","unstructured":"Beck, A., Hallak, N.: On the convergence to stationary points of deterministic and randomized feasible descent directions methods. SIAM J. Optim. 30, 56\u201379 (2020)","journal-title":"SIAM J. Optim."},{"key":"596_CR8","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":"596_CR9","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1080\/10556788.2022.2142582","volume":"38","author":"AS Berahas","year":"2022","unstructured":"Berahas, A.S., Sohab, O., Vicente, L.N.: Full-low evaluation methods for derivative-free optimization. Optim. Methods Softw. 38, 386\u2013411 (2022)","journal-title":"Optim. Methods Softw."},{"key":"596_CR10","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"2016","unstructured":"Bertsekas, D.P.: Nonlinear Programming, third edition Athena Scientific, Belmont, MA (2016)","edition":"third edition"},{"key":"596_CR11","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1093\/imamat\/6.1.76","volume":"6","author":"CG Broyden","year":"1970","unstructured":"Broyden, C.G.: The convergence of a class of double-rank minimization algorithms 1. General considerations. IMA J. Appl. Math. 6, 76\u201390 (1970)","journal-title":"IMA J. Appl. Math."},{"doi-asserted-by":"crossref","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983). Reissued by SIAM, Philadelphia, 1990","key":"596_CR12","DOI":"10.1137\/1.9781611971309"},{"doi-asserted-by":"crossref","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. MPS-SIAM Series on Optimization. Society for Industrial and Applied Mathematics, Philadelphia (2000)","key":"596_CR13","DOI":"10.1137\/1.9780898719857"},{"key":"596_CR14","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1137\/060673424","volume":"20","author":"AR Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Global convergence of general derivative-free trust-region algorithms to first- and second-order critical points. SIAM J. Optim. 20, 387\u2013415 (2009)","journal-title":"SIAM J. Optim."},{"key":"596_CR15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to Derivative-Free Optimization.MPS-SIAM Series on Optimization","author":"AR Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization.MPS-SIAM Series on Optimization. SIAM, Philadelphia (2009)"},{"doi-asserted-by":"crossref","unstructured":"Cust\u00f3dio, A.L., Scheinberg, K., Vicente, L.N.: Methodologies and software for derivative-free optimization. In: Terlaky, T., Anjos, M.F., Ahmed, S. (eds.) Chapter 37 of Advances and Trends in Optimization with Engineering Applications, MOS-SIAM Book Series on Optimization. SIAM, Philadelphia (2017)","key":"596_CR16","DOI":"10.1137\/1.9781611974683.ch37"},{"key":"596_CR17","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":"596_CR18","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1093\/comjnl\/13.3.317","volume":"13","author":"R Fletcher","year":"1970","unstructured":"Fletcher, R.: A new approach to variable metric algorithms. Comput. J. 13, 317\u2013322 (1970)","journal-title":"Comput. J."},{"unstructured":"Fukuda, K., Prodon, A.: Double description method revisited. In: Deza, M., Euler, R., Manoussakis, I. (eds.) Combinatorics and Computer Science: 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3\u20135, 1995 Selected Papers, pp. 91\u2013111. Springer (1996)","key":"596_CR19"},{"key":"596_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1090\/S0025-5718-1970-0258249-6","volume":"24","author":"D Goldfarb","year":"1970","unstructured":"Goldfarb, D.: A family of variable-metric methods derived by variational means. Math. Comp. 24, 23\u201326 (1970)","journal-title":"Math. Comp."},{"key":"596_CR21","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1080\/10556788.2010.549231","volume":"21","author":"S Gratton","year":"2011","unstructured":"Gratton, S., Toint, P., Tr\u00f6ltzsch, A.: An active-set trust-region method for derivative-free nonlinear bound-constrained optimization. Optim. Methods Softw. 21, 873\u2013894 (2011)","journal-title":"Optim. Methods Softw."},{"key":"596_CR22","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s10589-019-00062-4","volume":"72","author":"S Gratton","year":"2019","unstructured":"Gratton, S., Royer, C.W., Vicente, L.N., Zhang, Z.: Direct search based on probabilistic feasible descent for bound and linearly constrained problems. Comput. Optim. Appl. 72, 525\u2013559 (2019)","journal-title":"Comput. Optim. Appl."},{"unstructured":"Inc, T.M.: Global optimization toolbox, user\u2019s guide. Version 3.3, Oct (2014)","key":"596_CR23"},{"key":"596_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02985-5","volume-title":"Introduction to the Theory of Nonlinear Optimization","author":"J Jahn","year":"1994","unstructured":"Jahn, J.: Introduction to the Theory of Nonlinear Optimization. Springer Nature, New York (1994)"},{"key":"596_CR25","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, 385\u2013482 (2003)","journal-title":"SIAM Rev."},{"key":"596_CR26","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1137\/S1052623403433638","volume":"17","author":"TG Kolda","year":"2007","unstructured":"Kolda, T.G., Lewis, R.M., Torczon, V.: Stationarity results for generating set search for linearly constrained optimization. SIAM J. Optim. 17, 943\u2013968 (2007)","journal-title":"SIAM J. Optim."},{"key":"596_CR27","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.: Derivative-free optimization methods. Acta Numer 28, 287\u2013404 (2019)","journal-title":"Acta Numer"},{"key":"596_CR28","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, 1125\u20131143 (2024)","journal-title":"Optim. Eng."},{"key":"596_CR29","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, 1082\u20131099 (1999)","journal-title":"SIAM J. Optim."},{"key":"596_CR30","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, 917\u2013941 (2000)","journal-title":"SIAM J. Optim."},{"key":"596_CR31","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, 2507\u20132530 (2007)","journal-title":"SIAM J. Sci. Comput."},{"unstructured":"Luk\u0161an, L., Vlcek, J.: Test problems for nonsmooth unconstrained and linearly constrained optimization. Technical Report 798, Institut of Computer Science, Academy of Sciences of the Czech Republic (2000)","key":"596_CR32"},{"key":"596_CR33","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1287\/moor.5.2.167","volume":"5","author":"T Matheiss","year":"1980","unstructured":"Matheiss, T., Rubin, D.S.: A survey and comparison of methods for finding all vertices of convex polyhedral sets. Math. Oper. Res. 5, 167\u2013185 (1980)","journal-title":"Math. Oper. Res."},{"key":"596_CR34","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"J Mor\u00e9","year":"2009","unstructured":"Mor\u00e9, J., Wild, S.M.: Benchmarking derivative-free optimization algorithms. SIAM J. Optim. 20, 172\u2013191 (2009)","journal-title":"SIAM J. Optim."},{"key":"596_CR35","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, second edition Springer-Verlag, Berlin (2006)","edition":"second edition"},{"key":"596_CR36","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1137\/S1052623402407084","volume":"14","author":"CJ Price","year":"2003","unstructured":"Price, C.J., Coope, I.D.: Frames and grids in unconstrained and linearly constrained optimization: a nonsmooth approach. SIAM J. Optim. 14, 415\u2013438 (2003)","journal-title":"SIAM J. Optim."},{"key":"596_CR37","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1007\/s10898-012-9951-y","volume":"56","author":"LM Rios","year":"2013","unstructured":"Rios, L.M., Sahinidis, N.V.: Derivative-free optimization: a review of algorithms and comparison of software implementations. J. Glob. Optim. 56, 1247\u20131293 (2013)","journal-title":"J. Glob. Optim."},{"key":"596_CR38","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1090\/S0025-5718-1970-0274029-X","volume":"24","author":"DF Shanno","year":"1970","unstructured":"Shanno, D.F.: Conditioning of quasi-Newton methods for function minimization. Math. Comp. 24, 647\u2013656 (1970)","journal-title":"Math. Comp."},{"key":"596_CR39","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1080\/10556788.2022.2121832","volume":"38","author":"H-JM Shi","year":"2023","unstructured":"Shi, H.-J.M., Xuan, M.Q., Oztoprak, F., Nocedal, J.: On the numerical performance of finite-difference-based methods for derivative-free optimization. Optim. Methods Softw. 38, 289\u2013311 (2023)","journal-title":"Optim. Methods Softw."},{"key":"596_CR40","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\u201325 (1997)","journal-title":"SIAM J. Optim."},{"key":"596_CR41","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, 299\u2013325 (2012)","journal-title":"Math. Program."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00596-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00596-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00596-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T12:12:54Z","timestamp":1728389574000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00596-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,1]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["596"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00596-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2024,8,1]]},"assertion":[{"value":"3 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}