{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T18:27:34Z","timestamp":1772130454830,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T00:00:00Z","timestamp":1528761600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"crossref","award":["RDCPJ 490744 - 15"],"award-info":[{"award-number":["RDCPJ 490744 - 15"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10589-018-0016-0","type":"journal-article","created":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T09:48:39Z","timestamp":1528796919000},"page":"331-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Mesh-based Nelder\u2013Mead algorithm for inequality constrained optimization"],"prefix":"10.1007","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3043-5393","authenticated-orcid":false,"given":"Charles","family":"Audet","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8740-6155","authenticated-orcid":false,"given":"Christophe","family":"Tribes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10898-007-9234-1","volume":"41","author":"C Audet","year":"2008","unstructured":"Audet, C., B\u00e9chard, V., Le Digabel, S.: Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search. J. Global Optim. 41(2), 299\u2013318 (2008)","journal-title":"J. Global Optim."},{"issue":"1","key":"16_CR2","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":"1","key":"16_CR3","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(1), 445\u2013472 (2009)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"16_CR4","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":"16_CR5","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)"},{"issue":"2","key":"16_CR6","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":"3","key":"16_CR7","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s10898-017-0574-1","volume":"70","author":"C Audet","year":"2018","unstructured":"Audet, C., Kokkolaras, M., Le Digabel, S., Talgorn, B.: Order-based error for managing ensembles of surrogates in derivative-free optimization. J. Global Optim. 70(3), 645\u2013675 (2018)","journal-title":"J. Global Optim."},{"issue":"2","key":"16_CR8","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."},{"issue":"3","key":"16_CR9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.rimni.2013.06.005","volume":"29","author":"E Brea","year":"2013","unstructured":"Brea, E.: An extension of Nelder\u2013Mead method to nonlinear mixed-integer optimization problems. Rev. Int. M\u00e9tod. Num\u00e9r. C\u00e1lc Dise\u00f1o Ing. 29(3), 163\u2013174 (2013)","journal-title":"Rev. Int. M\u00e9tod. Num\u00e9r. C\u00e1lc Dise\u00f1o Ing."},{"issue":"3","key":"16_CR10","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10589-005-3912-z","volume":"34","author":"\u00c1 B\u0171rmen","year":"2006","unstructured":"B\u0171rmen, \u00c1., Puhan, J., Tuma, T.: Grid restrained Nelder\u2013Mead algorithm. Comput. Optim. Appl. 34(3), 359\u2013375 (2006)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"16_CR11","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\u2013Mead simplex method\u2014a 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":"10","key":"16_CR12","doi-asserted-by":"publisher","first-page":"1076","DOI":"10.1016\/j.cep.2010.07.014","volume":"49","author":"X Chen","year":"2010","unstructured":"Chen, X., Wang, N.: Optimization of short-time gasoline blending scheduling problem with a DNA based hybrid genetic algorithm. Chem. Eng. Process. 49(10), 1076\u20131083 (2010)","journal-title":"Chem. Eng. Process."},{"key":"16_CR13","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1983","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983). (reissued in 1990 by SIAM Publications, Philadelphia, as Vol.\u00a05 in the series Classics in Applied Mathematics)"},{"issue":"1","key":"16_CR14","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."},{"issue":"2","key":"16_CR15","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1023\/A:1026429319405","volume":"107","author":"ID Coope","year":"2000","unstructured":"Coope, I.D., Price, C.J.: Frame-based methods for unconstrained optimization. J. Optim. Theory Appl. 107(2), 261\u2013274 (2000)","journal-title":"J. Optim. Theory Appl."},{"key":"16_CR16","unstructured":"Craig, J.: Bluebird developer manual. \n                    http:\/\/www.civil.uwaterloo.ca\/jrcraig\/pdf\/bluebird_developers_manual.pdf\n                    \n                   (2002). Accessed 11 June 2018"},{"key":"16_CR17","first-page":"116","volume-title":"New Computing Environments: Microcomputers in Large-Scale Computing","author":"JE Dennis Jr","year":"1987","unstructured":"Dennis Jr., J.E., Woods, D.J.: Optimization on microcomputers: The Nelder\u2013Mead simplex algorithm. In: Wouk, A. (ed.) New Computing Environments: Microcomputers in Large-Scale Computing, pp. 116\u2013122. Society for Industrial and Applied Mathematics, Philadelphia, PA (1987)"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s101070100244","volume":"91","author":"R Fletcher","year":"2002","unstructured":"Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Math. Program. Ser. A 91, 239\u2013269 (2002)","journal-title":"Math. Program. Ser. A"},{"issue":"1","key":"16_CR19","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1137\/S105262340038081X","volume":"13","author":"R Fletcher","year":"2002","unstructured":"Fletcher, R., Leyffer, S., Toint, PhL: On the global convergence of a filter-SQP algorithm. SIAM J. Optim. 13(1), 44\u201359 (2002)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10589-010-9329-3","volume":"51","author":"F Gao","year":"2012","unstructured":"Gao, F., Han, L.: Implementing the Nelder\u2013Mead simplex algorithm with adaptive parameters. Comput. Optim. Appl. 51(1), 259\u2013277 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"16_CR21","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"NIM Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D., Toint, PhL: CUTEr (and SifDec): a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29(4), 373\u2013394 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"16_CR22","unstructured":"Hedar, A.-R.: Global optimization test problems. \n                    http:\/\/www-optima.amp.i.kyoto-u.ac.jp\/member\/student\/hedar\/Hedar_files\/TestGO.htm\n                    \n                   (2017). Accessed 11 June 2018"},{"key":"16_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-48320-2","volume-title":"Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems","author":"W Hock","year":"1981","unstructured":"Hock, W., Schittkowski, K.: Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems, vol. 187. Springer, Berlin (1981)"},{"key":"16_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, Berlin (1994)"},{"issue":"2","key":"16_CR25","first-page":"150","volume":"4","author":"M Jamil","year":"2013","unstructured":"Jamil, M., Yang, X.-S.: A literature survey of benchmark functions for global optimisation problems. Int. J. Math. Modell. Numer. Optim. 4(2), 150\u2013194 (2013)","journal-title":"Int. J. Math. Modell. Numer. Optim."},{"issue":"1","key":"16_CR26","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."},{"issue":"4","key":"16_CR27","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s11081-010-9118-y","volume":"12","author":"S Kitayama","year":"2011","unstructured":"Kitayama, S., Arakawa, M., Yamazaki, K.: Sequential approximate optimization using radial basis function network for engineering optimization. Optim. Eng. 12(4), 535\u2013557 (2011)","journal-title":"Optim. Eng."},{"key":"16_CR28","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1137\/S1052623496303470","volume":"9","author":"JC Lagarias","year":"1998","unstructured":"Lagarias, J.C., Reeds, J.A., Wright, M.H., Wright, P.E.: Convergence properties of the Nelder\u2013Mead simplex method in low dimensions. SIAM J. Optim. 9, 112\u2013147 (1998)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"16_CR29","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. Softw. 37(4), 44:1\u201344:15 (2011)","journal-title":"ACM Trans. Math. Softw."},{"key":"16_CR30","unstructured":"Luk\u0161an, L., Vl\u010dek, J.: Test problems for nonsmooth unconstrained and linearly constrained optimization. Technical Report V-798, ICS AS CR (2000)"},{"issue":"11","key":"16_CR31","doi-asserted-by":"publisher","first-page":"1894","DOI":"10.1016\/j.cageo.2011.03.017","volume":"37","author":"LS Matott","year":"2011","unstructured":"Matott, L.S., Leung, K., Sim, J.: Application of MATLAB and Python optimizers to two case studies involving groundwater flow and contaminant transport modeling. Comput. Geosci. 37(11), 1894\u20131899 (2011)","journal-title":"Comput. Geosci."},{"issue":"1","key":"16_CR32","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1137\/S1052623496303482","volume":"9","author":"KIM McKinnon","year":"1998","unstructured":"McKinnon, K.I.M.: Convergence of the Nelder\u2013Mead simplex method to a nonstationary point. SIAM J. Optim. 9(1), 148\u2013158 (1998)","journal-title":"SIAM J. Optim."},{"key":"16_CR33","first-page":"652","volume-title":"Lecture Notes in Computer Science","author":"Efr\u00e9n Mezura-Montes","year":"2005","unstructured":"Mezura-Montes, E., Coello, C.A.: Useful infeasible solutions in engineering optimization with evolutionary algorithms. In: Proceedings of the 4th Mexican International Conference on Advances in Artificial Intelligence, MICAI\u201905, pp. 652\u2013662, Springer, Berlin (2005)"},{"issue":"2","key":"16_CR34","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/S0377-2217(02)00833-0","volume":"151","author":"N Mladenovi\u0107","year":"2003","unstructured":"Mladenovi\u0107, N., Petrovi\u0107, J., Kova\u010devi\u0107-Vuj\u010di\u0107, V., \u010cangalovi\u0107, M.: Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. Eur. J. Oper. Res. 151(2), 389\u2013399 (2003)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"16_CR35","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J.J., Garbow, B.S., Hillstrom, Kenneth E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7(1), 17\u201341 (1981)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"16_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."},{"key":"16_CR37","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1014842520519","volume":"22","author":"L Nazareth","year":"2002","unstructured":"Nazareth, L., Tseng, P.: Gilding the lily: a variant of the Nelder\u2013Mead algorithm based on golden-section search. Comput. Optim. Appl. 22, 133\u2013144 (2002)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"16_CR38","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":"7","key":"16_CR39","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1109\/TUFFC.2007.390","volume":"54","author":"F Pigache","year":"2007","unstructured":"Pigache, F., Messine, F., Nogarede, B.: Optimal design of piezoelectric transformers: a rational approach based on an analytical model and a deterministic global optimization. IEEE Trans. Ultrason. Ferroelectr. Freq. Control 54(7), 1293\u20131302 (2007)","journal-title":"IEEE Trans. Ultrason. Ferroelectr. Freq. Control"},{"issue":"1","key":"16_CR40","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1014849028575","volume":"113","author":"CJ Price","year":"2002","unstructured":"Price, C.J., Coope, I.D., Byatt, D.: A convergent variant of the Nelder\u2013Mead algorithm. J. Optim. Theory Appl. 113(1), 5\u201319 (2002)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"16_CR41","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1115\/1.2826677","volume":"120","author":"JF Rodr\u00edguez","year":"1998","unstructured":"Rodr\u00edguez, J.F., Renaud, J.E., Watson, L.T.: Trust region augmented Lagrangian methods for sequential response surface approximation and optimization. J. Mech. Des. 120(1), 58\u201366 (1998). 03","journal-title":"J. Mech. Des."},{"key":"16_CR42","unstructured":"Strasser, M.: \u00dcbertrangung des Optimierungsverfahrens von Nelder und Mead auf restringierte Probleme. Diploma thesis, Numerical Mathematics Group, Technical University of Darmstadt, Germany (1994)"},{"issue":"3","key":"16_CR43","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1002\/ceat.200700322","volume":"31","author":"J Tao","year":"2008","unstructured":"Tao, J., Wang, N.: DNA double helix based hybrid GA for the gasoline blending recipe optimization problem. Chem. Eng. Technol. 31(3), 440\u2013451 (2008)","journal-title":"Chem. Eng. Technol."},{"issue":"8","key":"16_CR44","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1080\/03052150500289305","volume":"37","author":"C Tribes","year":"2005","unstructured":"Tribes, C., Dub\u00e9, J.-F., Tr\u00e9panier, J.-Y.: Decomposition of multidisciplinary optimization problems: formulations and application to a simplified wing design. Eng. Optim. 37(8), 775\u2013796 (2005)","journal-title":"Eng. Optim."},{"issue":"1","key":"16_CR45","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":"11","key":"16_CR46","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1016\/j.cherd.2010.03.005","volume":"88","author":"K Wang","year":"2010","unstructured":"Wang, K., Wang, N.: A novel RNA genetic algorithm for parameter estimation of dynamic systems. Chem. Eng. Res. Des. 88(11), 1485\u20131493 (2010)","journal-title":"Chem. Eng. Res. Des."},{"issue":"2","key":"16_CR47","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.compchemeng.2010.01.008","volume":"35","author":"J Zhao","year":"2011","unstructured":"Zhao, J., Wang, N.: A bio-inspired algorithm based on membrane computing and its application to gasoline blending scheduling. Comput. Chem. Eng. 35(2), 272\u2013283 (2011)","journal-title":"Comput. Chem. Eng."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-0016-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0016-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0016-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T19:21:52Z","timestamp":1560280912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-0016-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,12]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["16"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-0016-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,12]]},"assertion":[{"value":"9 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}