{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T20:13:04Z","timestamp":1775074384715,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T00:00:00Z","timestamp":1548115200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100009160","name":"Universit\u00e9 Toulouse III - Paul Sabatier","doi-asserted-by":"publisher","award":["Doctoral Grant \u201cContingent Pr\u00e9sident\u201d"],"award-info":[{"award-number":["Doctoral Grant \u201cContingent Pr\u00e9sident\u201d"]}],"id":[{"id":"10.13039\/501100009160","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UID\/MAT\/00324\/2013"],"award-info":[{"award-number":["UID\/MAT\/00324\/2013"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["P2020 SAICT-PAC\/0011\/2015"],"award-info":[{"award-number":["P2020 SAICT-PAC\/0011\/2015"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004377","name":"Hong Kong Polytechnic University","doi-asserted-by":"publisher","award":["Startup Grant 1-ZVHT"],"award-info":[{"award-number":["Startup Grant 1-ZVHT"]}],"id":[{"id":"10.13039\/501100004377","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":[[2019,4]]},"DOI":"10.1007\/s10589-019-00062-4","type":"journal-article","created":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T05:09:07Z","timestamp":1548306547000},"page":"525-559","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Direct search based on probabilistic feasible descent for bound and linearly constrained problems"],"prefix":"10.1007","volume":"72","author":[{"given":"S.","family":"Gratton","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2452-2172","authenticated-orcid":false,"given":"C. W.","family":"Royer","sequence":"additional","affiliation":[]},{"given":"L. N.","family":"Vicente","sequence":"additional","affiliation":[]},{"given":"Z.","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,22]]},"reference":[{"key":"62_CR1","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 Jr., J.E., Pingel, R.L.: Pattern search in the presence of degenerate linear constraints. Optim. Methods Softw. 23, 297\u2013319 (2008)","journal-title":"Optim. Methods Softw."},{"key":"62_CR2","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, Berlin (2017)"},{"key":"62_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-014-9708-2","volume":"61","author":"C Audet","year":"2015","unstructured":"Audet, C., Le Digabel, S., Peyrega, M.: Linear equalities in blackbox optimization. Comput. Optim. Appl. 61, 1\u201323 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"62_CR4","unstructured":"Audet, C., Le Digabel, S., Tribes, C.: NOMAD user guide. Technical report G-2009-37, Les cahiers du GERAD (2009)"},{"key":"62_CR5","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1137\/070692662","volume":"20","author":"C Audet","year":"2009","unstructured":"Audet, C., Dennis Jr., J.E.: A progressive barrier for derivative-free nonlinear programming. SIAM J. Optim. 20, 445\u2013472 (2009)","journal-title":"SIAM J. Optim."},{"key":"62_CR6","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, 1238\u20131264 (2014)","journal-title":"SIAM J. Optim."},{"key":"62_CR7","unstructured":"Birgin, E.G., Gardenghi, J.L., Mart\u00ednez, J.M., Santos, S.A., Toint, Ph.L.: Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models. SIAM J. Optim. 29, 951\u2013967 (2016)"},{"key":"62_CR8","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity. IMA J. Numer. Anal. 32, 1662\u20131695 (2012)"},{"key":"62_CR9","doi-asserted-by":"crossref","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: On the complexity of finding first-order critical points in constrained nonlinear programming. Math. Program. 144, 93\u2013106 (2014)","DOI":"10.1007\/s10107-012-0617-9"},{"key":"62_CR10","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)"},{"key":"62_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10589-015-9747-3","volume":"62","author":"Y Diouane","year":"2015","unstructured":"Diouane, Y., Gratton, S., Vicente, L.N.: Globally convergent evolution strategies for constrained optimization. Comput. Optim. Appl. 62, 323\u2013346 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"62_CR12","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":"62_CR13","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":"62_CR14","unstructured":"Dreisigmeyer, D.W.: Equality constraints, Riemannian manifolds and direct-search methods. Technical report LA-UR-06-7406, Los Alamos National Laboratory (2006)"},{"key":"62_CR15","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1093\/imanum\/15.4.585","volume":"15","author":"C Elster","year":"1995","unstructured":"Elster, C., Neumaier, A.: A grid algorithm for bound constrained optimization of noisy functions. IMA J. Numer. Anal. 15, 585\u2013608 (1995)","journal-title":"IMA J. Numer. Anal."},{"key":"62_CR16","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, 3\u20135 July 1995, Selected Papers, pp. 91\u2013111. Springer (1996)"},{"key":"62_CR17","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1080\/10556788.2012.693926","volume":"28","author":"UM Garc\u00eda-Palomares","year":"2013","unstructured":"Garc\u00eda-Palomares, U.M., Garc\u00eda-Urrea, I.J., Rodr\u00edguez-Hern\u00e1ndez, P.S.: On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization. Optim. Methods Softw. 28, 1233\u20131261 (2013)","journal-title":"Optim. Methods Softw."},{"key":"62_CR18","unstructured":"Gould, N.I.M., Orban, D., Toint, Ph.L.: CUTEst: a constrained and unconstrained testing environment with safe threads. Comput. Optim. Appl. 60, 545\u2013557 (2015)"},{"key":"62_CR19","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":"62_CR20","doi-asserted-by":"publisher","first-page":"1980","DOI":"10.1137\/130917661","volume":"24","author":"S Gratton","year":"2014","unstructured":"Gratton, S., Vicente, L.N.: A merit function approach for direct search. SIAM J. Optim. 24, 1980\u20131998 (2014)","journal-title":"SIAM J. Optim."},{"key":"62_CR21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971903","volume-title":"Implicit Filtering Software Environment and Tools","author":"CT Kelley","year":"2011","unstructured":"Kelley, C.T.: Implicit Filtering Software Environment and Tools. SIAM, Philadelphia (2011)"},{"key":"62_CR22","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":"62_CR23","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, 943\u2013968 (2006)","journal-title":"SIAM J. Optim."},{"key":"62_CR24","doi-asserted-by":"publisher","first-page":"44:1","DOI":"10.1145\/1916461.1916468","volume":"37","author":"S Digabel Le","year":"2011","unstructured":"Le Digabel, S.: Algorithm 909: NOMAD: Nonlinear optimization with the MADS algorithm. ACM Trans. Math. Software 37, 44:1\u201344:15 (2011)","journal-title":"ACM Trans. Math. Software"},{"key":"62_CR25","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."},{"key":"62_CR26","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":"62_CR27","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 algorithms for linearly constrained minimization. SIAM J. Optim. 10, 917\u2013941 (2000)","journal-title":"SIAM J. Optim."},{"key":"62_CR28","unstructured":"Lewis, R.M., Torczon, V.: A direct search approach to nonlinear programming problems using an augmented Lagrangian method with explicit treatment of the linear constraints. Technical report WM-CS-2010-01, College of William & Mary, Department of Computer Science (2010)"},{"key":"62_CR29","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1016\/j.amc.2005.12.065","volume":"181","author":"L Liu","year":"2006","unstructured":"Liu, L., Zhang, X.: Generalized pattern search methods for linearly equality constrained optimization problems. Appl. Math. Comput. 181, 527\u2013535 (2006)","journal-title":"Appl. Math. Comput."},{"key":"62_CR30","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1023\/A:1013735414984","volume":"21","author":"S Lucidi","year":"2002","unstructured":"Lucidi, S., Sciandrone, M.: A derivative-free algorithm for bound constrained minimization. Comput. Optim. Appl. 21, 119\u2013142 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"62_CR31","doi-asserted-by":"publisher","first-page":"31","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, 31\u201359 (2002)","journal-title":"Math. Program."},{"key":"62_CR32","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":"62_CR33","first-page":"238","volume":"255","author":"J-J Moreau","year":"1962","unstructured":"Moreau, J.-J.: D\u00e9composition orthogonale d\u2019un espace hilbertien selon deux c\u00f4nes mutuellement polaires. C. R. Acad. Sci. Paris 255, 238\u2013240 (1962)","journal-title":"C. R. Acad. Sci. Paris"},{"key":"62_CR34","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":"62_CR35","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810886","volume-title":"Measures Integrals and Martingales","author":"RL Schilling","year":"2005","unstructured":"Schilling, R.L.: Measures Integrals and Martingales. Cambridge University Press, Cambridge (2005)"},{"key":"62_CR36","unstructured":"The Mathworks, Inc.: Global Optimization Toolbox User\u2019s Guide, version 3.3, Oct 2014"},{"key":"62_CR37","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10898-007-9133-5","volume":"39","author":"AIF Vaz","year":"2007","unstructured":"Vaz, A.I.F., Vicente, L.N.: A particle swarm pattern search method for bound constrained global optimization. J. Global Optim. 39, 197\u2013219 (2007)","journal-title":"J. Global Optim."},{"key":"62_CR38","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1080\/10556780902909948","volume":"24","author":"AIF Vaz","year":"2009","unstructured":"Vaz, A.I.F., Vicente, L.N.: PSwarm: a hybrid solver for linearly constrained global derivative-free optimization. Optim. Methods Softw. 24, 669\u2013685 (2009)","journal-title":"Optim. Methods Softw."},{"key":"62_CR39","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":"62_CR40","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/BF02591750","volume":"31","author":"Y Yuan","year":"1985","unstructured":"Yuan, Y.: Conditions for convergence of trust region algorithms for nonsmooth optimization. Math. Program. 31, 220\u2013228 (1985)","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-019-00062-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00062-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00062-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,10]],"date-time":"2022-09-10T21:16:02Z","timestamp":1662844562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00062-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,22]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["62"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00062-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,22]]},"assertion":[{"value":"20 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}