{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:36:12Z","timestamp":1765888572046,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,3,11]],"date-time":"2021-03-11T00:00:00Z","timestamp":1615420800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,11]],"date-time":"2021-03-11T00:00:00Z","timestamp":1615420800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"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-020-00249-0","type":"journal-article","created":{"date-parts":[[2021,3,11]],"date-time":"2021-03-11T11:03:13Z","timestamp":1615460593000},"page":"1-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3043-5393","authenticated-orcid":false,"given":"Charles","family":"Audet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1515-4251","authenticated-orcid":false,"given":"Kwassi Joseph","family":"Dzahini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1546-3393","authenticated-orcid":false,"given":"Michael","family":"Kokkolaras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3148-5090","authenticated-orcid":false,"given":"S\u00e9bastien","family":"Le Digabel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,11]]},"reference":[{"issue":"2","key":"249_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 Jr., J.E., Le Digabel, S.: OrthoMADS: a deterministic MADS instance with orthogonal directions. SIAM J. Optim. 20(2), 948\u2013966 (2009)","journal-title":"SIAM J. Optim."},{"key":"249_CR2","unstructured":"Alarie, S., Audet, C., Bouchet, P.-Y., Le Digabel, S.: Optimization of noisy blackboxes with adaptive precision. Technical Report G-2019-84, Les cahiers du GERAD (2019)"},{"issue":"4","key":"249_CR3","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10288-014-0275-2","volume":"12","author":"S Amaran","year":"2014","unstructured":"Amaran, S., Sahinidis, N.V., Sharda, B., Bury, S.J.: Simulation optimization: a review of algorithms and applications. 4OR 12(4), 301\u2013333 (2014)","journal-title":"4OR"},{"issue":"3","key":"249_CR4","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1137\/S1052623496312848","volume":"11","author":"EJ Anderson","year":"2001","unstructured":"Anderson, E.J., Ferris, M.C.: A direct search algorithm for optimization with noisy function evaluations. SIAM J. Optim. 11(3), 837\u2013857 (2001)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"249_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/ijoc.1100.0438","volume":"24","author":"E Ang\u00fcn","year":"2012","unstructured":"Ang\u00fcn, E., Kleijnen, J.: An asymptotic test of optimality conditions in multiresponse simulation optimization. INFORMS J. Comput. 24(1), 53\u201365 (2012)","journal-title":"INFORMS J. Comput."},{"key":"249_CR6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/978-1-4939-1124-0_2","volume-title":"Mathematics Without Boundaries: Surveys in Interdisciplinary Research","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: Surveys in Interdisciplinary Research, vol. 2, pp. 31\u201356. Springer, New York (2014)"},{"issue":"3","key":"249_CR7","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/S1052623400378742","volume":"13","author":"C Audet","year":"2003","unstructured":"Audet, C., Dennis Jr., J.E.: Analysis of generalized pattern searches. SIAM J. Optim. 13(3), 889\u2013903 (2003)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"249_CR8","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/040603371","volume":"17","author":"C Audet","year":"2006","unstructured":"Audet, C., Dennis Jr., J.E.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17(1), 188\u2013217 (2006)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"249_CR9","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1137\/070707518","volume":"19","author":"C Audet","year":"2008","unstructured":"Audet, C., Dennis Jr., J.E., Le Digabel, S.: Parallel space decomposition of the mesh adaptive direct search algorithm. SIAM J. Optim. 19(3), 1150\u20131170 (2008)","journal-title":"SIAM J. Optim."},{"key":"249_CR10","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)"},{"issue":"2","key":"249_CR11","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1137\/120895056","volume":"24","author":"C Audet","year":"2014","unstructured":"Audet, C., Ianni, A., Le Digabel, S., Tribes, C.: Reducing the number of function evaluations in mesh adaptive direct search algorithms. SIAM J. Optim. 24(2), 621\u2013642 (2014)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"249_CR12","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s11590-017-1226-6","volume":"12","author":"C Audet","year":"2018","unstructured":"Audet, C., Ihaddadene, A., Le Digabel, S., Tribes, C.: Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm. Optim. Lett. 12(4), 675\u2013689 (2018)","journal-title":"Optim. Lett."},{"issue":"2","key":"249_CR13","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. Optimization and Engineering 17(2), 333\u2013358 (2016)","journal-title":"Optimization and Engineering"},{"issue":"2","key":"249_CR14","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1137\/18M1175872","volume":"29","author":"C Audet","year":"2019","unstructured":"Audet, C., Le Digabel, S., Tribes, C.: The mesh adaptive direct search algorithm for granular and discrete variables. SIAM J. Optim. 29(2), 1164\u20131189 (2019)","journal-title":"SIAM J. Optim."},{"key":"249_CR15","unstructured":"Augustin, F., Marzouk, Y.M.: A trust-region method for derivative-free nonlinear constrained stochastic optimization. Technical report, arXiv (2017)"},{"key":"249_CR16","unstructured":"Balasubramanian, K., Ghadimi, S.: Zeroth-order nonconvex stochastic optimization: handling constraints, high-dimensionality and saddle-points. Technical report, arXiv (2019)"},{"issue":"3","key":"249_CR17","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.1137\/130915984","volume":"24","author":"AS Bandeira","year":"2014","unstructured":"Bandeira, A.S., Scheinberg, K., Vicente, L.N.: Convergence of trust-region methods based on probabilistic models. SIAM J. Optim. 24(3), 1238\u20131264 (2014)","journal-title":"SIAM J. Optim."},{"issue":"7","key":"249_CR18","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1287\/mnsc.42.7.954","volume":"42","author":"RR Barton","year":"1996","unstructured":"Barton, R.R., Ivey Jr., J.S.: Nelder\u2013Mead simplex modifications for simulation optimization. Manage. Sci. 42(7), 954\u2013973 (1996)","journal-title":"Manage. Sci."},{"key":"249_CR19","volume-title":"A Basic Course in Probability Theory","author":"RN Bhattacharya","year":"2007","unstructured":"Bhattacharya, R.N., Waymire, E.C.: A Basic Course in Probability Theory, vol. 69. Springer, Berlin (2007)"},{"issue":"2","key":"249_CR20","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1287\/ijoo.2019.0016","volume":"1","author":"J Blanchet","year":"2019","unstructured":"Blanchet, J., Cartis, C., Menickelly, M., Scheinberg, K.: Convergence rate analysis of a stochastic trust region method via supermartingales. INFORMS J. Optim. 1(2), 92\u2013119 (2019)","journal-title":"INFORMS J. Optim."},{"issue":"2","key":"249_CR21","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(2), 337\u2013375 (2018)","journal-title":"Math. Program."},{"issue":"3","key":"249_CR22","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1016\/j.ejor.2012.02.028","volume":"220","author":"KH Chang","year":"2012","unstructured":"Chang, K.H.: Stochastic Nelder-Mead simplex method - A new globally convergent direct search method for simulation optimization. Eur. J. Oper. Res. 220(3), 684\u2013694 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"249_CR23","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10107-017-1141-8","volume":"169","author":"R Chen","year":"2018","unstructured":"Chen, R., Menickelly, M., Scheinberg, K.: Stochastic optimization using a trust-region method and random models. Math. Program. 169(2), 447\u2013487 (2018)","journal-title":"Math. Program."},{"key":"249_CR24","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York, (1983). Reissued in 1990 by SIAM Publications, Philadelphia, as vol. 5 in the series Classics in Applied Mathematics"},{"issue":"1","key":"249_CR25","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/10556788.2011.623162","volume":"28","author":"AR Conn","year":"2013","unstructured":"Conn, A.R., Le Digabel, S.: Use of quadratic models with mesh-adaptive direct search for constrained black box optimization. Optim. Methods Softw. 28(1), 139\u2013158 (2013)","journal-title":"Optim. Methods Softw."},{"key":"249_CR26","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":"3","key":"249_CR27","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1287\/ijoo.2018.0010","volume":"1","author":"FE Curtis","year":"2019","unstructured":"Curtis, F.E., Scheinberg, K., Shi, R.: A stochastic trust region algorithm based on careful step normalization. INFORMS J. Optim. 1(3), 200\u2013220 (2019)","journal-title":"INFORMS J. Optim."},{"issue":"2","key":"249_CR28","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(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"249_CR29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511779398","volume-title":"Probability: Theory and Examples","author":"R Durrett","year":"2010","unstructured":"Durrett, R.: Probability: Theory and Examples. Cambridge University Press, Cambridge (2010)"},{"key":"249_CR30","first-page":"575","volume":"13","author":"MC Fu","year":"2006","unstructured":"Fu, M.C.: Gradient estimation. Handb. Oper. Res. Manag. Sci. 13, 575\u2013616 (2006)","journal-title":"Handb. Oper. Res. Manag. Sci."},{"issue":"3","key":"249_CR31","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, PhL: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60(3), 545\u2013557 (2015)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"249_CR32","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1214\/aoms\/1177729392","volume":"23","author":"J Kiefer","year":"1952","unstructured":"Kiefer, J., Wolfowitz, J., et al.: Stochastic estimation of the maximum of a regression function. Ann. Math. Stat. 23(3), 462\u2013466 (1952)","journal-title":"Ann. Math. Stat."},{"key":"249_CR33","unstructured":"Kulunchakov, A., Mairal, J.: Estimate sequences for stochastic composite optimization: variance reduction, acceleration, and robustness to noise. Technical report, arXiv (2019)"},{"issue":"3","key":"249_CR34","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s10589-016-9827-z","volume":"64","author":"J Larson","year":"2016","unstructured":"Larson, J., Billups, S.C.: Stochastic derivative-free optimization using a trust region framework. Comput. Optim. Appl. 64(3), 619\u2013645 (2016)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"249_CR35","doi-asserted-by":"publisher","first-page":"44:1","DOI":"10.1145\/1916461.1916468","volume":"37","author":"S Le Digabel","year":"2011","unstructured":"Le Digabel, S.: Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm. ACM Trans. Math. Softw. 37(4), 44:1\u201344:15 (2011)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"249_CR36","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."},{"issue":"4","key":"249_CR37","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(4), 308\u2013313 (1965)","journal-title":"Comput. J."},{"issue":"1","key":"249_CR38","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 expected complexity analysis. SIAM J. Optim. 30(1), 349\u2013376 (2020)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"249_CR39","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":"249_CR40","unstructured":"Wang, X., Yuan, Y.: Stochastic trust region methods with trust region radius depending on probabilistic models. Technical report, arXiv (2019)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00249-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-020-00249-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00249-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T23:17:21Z","timestamp":1698016641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-020-00249-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,11]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["249"],"URL":"https:\/\/doi.org\/10.1007\/s10589-020-00249-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2021,3,11]]},"assertion":[{"value":"2 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}