{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T10:10:24Z","timestamp":1698747024737},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,12,21]],"date-time":"2019-12-21T00:00:00Z","timestamp":1576886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,12,21]],"date-time":"2019-12-21T00:00:00Z","timestamp":1576886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s12065-019-00324-4","type":"journal-article","created":{"date-parts":[[2019,12,21]],"date-time":"2019-12-21T11:02:21Z","timestamp":1576926141000},"page":"1779-1788","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reducing the number of function evaluations in derivative-free algorithm for bound constrained optimization"],"prefix":"10.1007","volume":"16","author":[{"given":"Shanxue","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zuqiao","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiping","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongwei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,21]]},"reference":[{"issue":"1","key":"324_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S1052623493250780","volume":"7","author":"V Torczon","year":"1997","unstructured":"Torczon V (1997) On the convergence of pattern search algorithms. SIAM J Optim 7(1):1\u201325","journal-title":"SIAM J Optim"},{"key":"324_CR2","unstructured":"Fermi E, Metropolis N (1952) Numerical solution of a minimum problem. Los Alamos Unclassified Report LA-1492, Los Alamos National Laboratory, Los Alamos"},{"issue":"2","key":"324_CR3","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/2985505","volume":"6","author":"G Box","year":"1957","unstructured":"Box G (1957) Evolutionary operation: a method for increasing industrial productivity. Appl Stat 6(2):81\u2013101","journal-title":"Appl Stat"},{"issue":"2","key":"324_CR4","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1145\/321062.321069","volume":"8","author":"R Hooke","year":"1961","unstructured":"Hooke R, Jeeves T (1961) Direct search solution of numerical and statistical problems. J Assoc Comput Mach 8(2):212\u2013229","journal-title":"J Assoc Comput Mach"},{"issue":"4","key":"324_CR5","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1137\/0801027","volume":"1","author":"J Dennis","year":"1991","unstructured":"Dennis J, Torczon V (1991) Direct search methods on parallel machines. SIAM J Optim 1(4):448\u2013474","journal-title":"SIAM J Optim"},{"issue":"4","key":"324_CR6","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.1137\/S1052623496300507","volume":"9","author":"R Lewis","year":"1999","unstructured":"Lewis R, Torczon V (1999) Pattern search algorithms for bound constrained minimization. SIAM J Optim 9(4):1082\u20131099","journal-title":"SIAM J Optim"},{"issue":"3","key":"324_CR7","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1137\/S1052623497331373","volume":"10","author":"R Lewis","year":"2000","unstructured":"Lewis R, Torczon V (2000) Pattern search methods for linearly constrained minimization. SIAM J Optim 10(3):917\u2013941","journal-title":"SIAM J Optim"},{"key":"324_CR8","unstructured":"Lewis R, Torczon V (1996) Rank ordering and positive bases in pattern search algorithms. Technical Report 96-71, Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, USA"},{"key":"324_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1023\/A:1013735414984","volume":"21","author":"S Lucidi","year":"2002","unstructured":"Lucidi S, Sciandrone M (2002) A derivative-free algorithm for bound constrained optimization. Comput Optim Appl 21:119\u2013142","journal-title":"Comput Optim Appl"},{"issue":"4","key":"324_CR10","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1137\/040615821","volume":"16","author":"G Liuzzi","year":"2006","unstructured":"Liuzzi G, Lucidi S, Sciandrone M (2006) A derivative-free algorithm for linearly constrained finite minimax problems. SIAM J Optim 16(4):1054\u20131075","journal-title":"SIAM J Optim"},{"issue":"5","key":"324_CR11","doi-asserted-by":"publisher","first-page":"2614","DOI":"10.1137\/090750639","volume":"20","author":"G Liuzzi","year":"2010","unstructured":"Liuzzi G, Lucidi S, Sciandrone M (2010) Sequential penalty derivative-free methods for nonlinear constrained optimization. SIAM J Optim 20(5):2614\u20132635","journal-title":"SIAM J Optim"},{"issue":"2","key":"324_CR12","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s10589-011-9405-3","volume":"53","author":"G Liuzzi","year":"2012","unstructured":"Liuzzi G, Lucidi S, Rinaldi F (2012) Derivative-free methods for bound constrained mixed-integer optimization. Comput Optim Appl 53(2):505\u2013526","journal-title":"Comput Optim Appl"},{"issue":"3","key":"324_CR13","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1007\/s10957-014-0617-4","volume":"164","author":"G Liuzzi","year":"2014","unstructured":"Liuzzi G, Lucidi S, Rinaldi F (2014) Derivative-free methods for mixed-integer constrained optimization problems. J Optim Theory Appl 164(3):933\u2013965","journal-title":"J Optim Theory Appl"},{"issue":"1","key":"324_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s13675-012-0003-7","volume":"1","author":"L Vicente","year":"2013","unstructured":"Vicente L (2013) Worst case complexity of direct search. EURO J Comput Optim 1(1):143\u2013153","journal-title":"EURO J Comput Optim"},{"issue":"4","key":"324_CR15","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, Zhang Z (2016) On the optimal order of worst case complexity of direct search. Optim Lett 10(4):699\u2013708","journal-title":"Optim Lett"},{"issue":"2","key":"324_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10589-017-9953-2","volume":"69","author":"G Cocchi","year":"2018","unstructured":"Cocchi G, Liuzzi G, Papini A et al (2018) An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints. Comput Optim Appl 69(2):267\u2013296","journal-title":"Comput Optim Appl"},{"key":"324_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-018-1364-5","author":"V Latorre","year":"2018","unstructured":"Latorre V, Habal H, Graeb H et al (2018) Derivative free methodologies for circuit worst case analysis. Optim Lett. https:\/\/doi.org\/10.1007\/s11590-018-1364-5","journal-title":"Optim Lett"},{"issue":"1","key":"324_CR18","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/040603371","volume":"17","author":"C Audet","year":"2006","unstructured":"Audet C, Dennis J (2006) Mesh adaptive direct search algorithms for constrained optimization. SIAM J Optim 17(1):188\u2013217","journal-title":"SIAM J Optim"},{"issue":"2","key":"324_CR19","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1137\/080716980","volume":"20","author":"MA Abramson","year":"2009","unstructured":"Abramson MA, Audet C, Dennis JE Jr (2009) OrthoMADS: a deterministic MADS instance with orthogonal directions. SIAM J Optim 20(2):948\u2013966","journal-title":"SIAM J Optim"},{"issue":"2","key":"324_CR20","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1137\/120895056","volume":"24","author":"A Ianni","year":"2014","unstructured":"Ianni A, Audet C, Digabel SL, Tribes C (2014) Reducing the number of function evaluations in mesh adaptive direct search algorithms. SIAM J Optim 24(2):621\u2013642","journal-title":"SIAM J Optim"},{"issue":"3","key":"324_CR21","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s11590-010-0270-2","volume":"6","author":"G Liuzzi","year":"2012","unstructured":"Liuzzi G, Risi A (2012) A decomposition algorithm for unconstrained optimization problems with partial derivative information. Optim Lett 6(3):437\u2013450","journal-title":"Optim Lett"},{"issue":"1","key":"324_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-014-9665-9","volume":"60","author":"L Grippo","year":"2015","unstructured":"Grippo L, Rinaldi F (2015) A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations. Computational Optim Appl 60(1):1\u201333","journal-title":"Computational Optim Appl"},{"issue":"28","key":"324_CR23","first-page":"770","volume":"28","author":"A Cust","year":"2006","unstructured":"Cust A (2006) Using simplex gradients of nonsmooth functions in direct search methods. IMA J Numer Anal 28(28):770\u2013784 (15)","journal-title":"IMA J Numer Anal"},{"issue":"4","key":"324_CR24","doi-asserted-by":"publisher","first-page":"1C15","DOI":"10.1145\/1916461.1916468","volume":"37","author":"S Le Digabel","year":"2011","unstructured":"Le Digabel S (2011) Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm. ACM Trans Math Softw 37(4):1C15","journal-title":"ACM Trans Math Softw"},{"key":"324_CR25","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 (1995) A grid algorithm for bound-constrained optimization of noisy functions. IMA J Numer Anal 15:585\u2013608","journal-title":"IMA J Numer Anal"},{"issue":"1","key":"324_CR26","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF00934594","volume":"30","author":"W Hock","year":"1980","unstructured":"Hock W, Schittkowski K (1980) Test examples for nonlinear programming codes. J Optim Theory Appl 30(1):127\u2013129","journal-title":"J Optim Theory Appl"},{"key":"324_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61582-5","volume-title":"More test examples for nonlinear programming codes. Lecture notes in economics and mathematical systems","author":"K Schittkowski","year":"1987","unstructured":"Schittkowski K (1987) More test examples for nonlinear programming codes. Lecture notes in economics and mathematical systems, vol 282. Springer, Berlin"},{"key":"324_CR28","unstructured":"Hedar A (2013) Test functions for unconstrained global optimization. http:\/\/www-optima.amp.i.kyoto-u.ac.jp\/member\/student\/hedar\/Hedar_?les\/TestGO_?les\/Page364.htm. Accessed 15 Feb 2013"},{"key":"324_CR29","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"J More","year":"2009","unstructured":"More J, Wild A (2009) Benchmarking derivative-free optimization algorithms. SIAM J Optim 20:172\u2013191","journal-title":"SIAM J Optim"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-019-00324-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-019-00324-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-019-00324-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T12:08:59Z","timestamp":1698667739000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-019-00324-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,21]]},"references-count":29,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["324"],"URL":"https:\/\/doi.org\/10.1007\/s12065-019-00324-4","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,21]]},"assertion":[{"value":"22 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}