{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T09:09:48Z","timestamp":1718788188054},"reference-count":64,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T00:00:00Z","timestamp":1465776000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"A direct search algorithm is proposed for minimizing an arbitrary real valued function. The algorithm uses a new function transformation and three simplex-based operations. The function transformation provides global exploration features, while the simplex-based operations guarantees the termination of the algorithm and provides global convergence to a stationary point if the cost function is differentiable and its gradient is Lipschitz continuous. The algorithm\u2019s performance has been extensively tested using benchmark functions and compared to some well-known global optimization algorithms. The results of the computational study show that the algorithm combines both simplicity and efficiency and is competitive with the heuristics-based strategies presently used for global optimization.<\/jats:p>","DOI":"10.3390\/a9020040","type":"journal-article","created":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T14:29:22Z","timestamp":1465828162000},"page":"40","source":"Crossref","is-referenced-by-count":16,"title":["A Direct Search Algorithm for Global Optimization"],"prefix":"10.3390","volume":"9","author":[{"given":"Enrique","family":"Baeyens","sequence":"first","affiliation":[{"name":"Instituto de las Tecnolog\u00edas Avanzadas de la Producci\u00f3n (ITAP), Universidad de Valladolid, Paseo del Cauce 59, 47011 Valladolid, Spain"}]},{"given":"Alberto","family":"Herreros","sequence":"additional","affiliation":[{"name":"Instituto de las Tecnolog\u00edas Avanzadas de la Producci\u00f3n (ITAP), Universidad de Valladolid, Paseo del Cauce 59, 47011 Valladolid, Spain"}]},{"given":"Jos\u00e9","family":"Per\u00e1n","sequence":"additional","affiliation":[{"name":"Centro Tecnol\u00f3gico Cartif, Parque Tecnol\u00f3gico de Boecillo 205, 47151 Bocillo, Spain"}]}],"member":"1968","published-online":{"date-parts":[[2016,6,13]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0377-0427(00)00423-4","article-title":"Direct Search Methods: Then and Now","volume":"124","author":"Lewis","year":"2000","journal-title":"J. Comput. Appl. Math."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Cohn, A., Scheinberg, K., and Vicente, L. (2009). Introduction to Derivative-Free Optimization, SIAM.","DOI":"10.1137\/1.9780898718768"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M., and Romeijn, H.E. (2002). Handbook of Global Optimization, Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4757-5362-2"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1137\/S003614450242889","article-title":"Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods","volume":"45","author":"Kolda","year":"2003","journal-title":"SIAM Rev."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1017\/S0962492904000194","article-title":"Complete Search in Continuous Global Optimization and Constraint Satisfaction","volume":"13","author":"Neumaier","year":"2004","journal-title":"Acta Numer."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Scheinberg, K., and Vicente, L.N. (2009). Introduction to Derivative-Free Optimization, SIAM.","DOI":"10.1137\/1.9780898718768"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1007\/s10898-012-9951-y","article-title":"Derivative-free optimization: A review of algorithms and comparison of software implementations","volume":"56","author":"Rios","year":"2013","journal-title":"J. Glob. Optim."},{"key":"ref_8","unstructured":"Murray, W. (1972). Numerical Methods for Unconstrained Optimization, Academic Press."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0041-5553(71)90065-6","article-title":"Numerical methods for finding global extrema (case of a non-uniform mesh)","volume":"11","author":"Evtushenko","year":"1971","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1007\/BF01031993","article-title":"A simple algorithm for searching for the global extremum of a function of several variables and its utilization in the problem of approximating functions","volume":"15","author":"Strongin","year":"1972","journal-title":"Radiophys. Quantum Electron."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0041-5553(89)90002-5","article-title":"A global minimization algorithm with parallel iterations","volume":"29","author":"Sergeyev","year":"1989","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/0801027","article-title":"Direct Search Methods On Parallel Machines","volume":"1","author":"Dennis","year":"1991","journal-title":"SIAM J. Optim."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/321062.321069","article-title":"Direct search solution of numerical and statistical problems","volume":"8","author":"Hooke","year":"1961","journal-title":"J. ACM"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","article-title":"A Simplex Method for Function Minimization","volume":"7","author":"Nelder","year":"1965","journal-title":"Comput. J."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1080\/00401706.1962.10490033","article-title":"Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation","volume":"4","author":"Spendley","year":"1962","journal-title":"Technometrics"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1137\/S1052623496303470","article-title":"Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions","volume":"9","author":"Lagarias","year":"1998","journal-title":"SIAM J. Optim."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Conn, A., Gould, N., and Toint, P. (2000). Trust-Region Methods, Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9780898719857"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s10898-004-0570-0","article-title":"Constrained global optimization of expensive black box functions using radial basis functions","volume":"31","author":"Regis","year":"2005","journal-title":"J. Glob. Optim."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10589-009-9283-0","article-title":"Incorporating minimum Frobenius norm models in direct search","volume":"46","author":"Custodio","year":"2010","journal-title":"Comput. Optim. Appl."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/10556788.2011.623162","article-title":"Use of quadratic models with mesh-adaptive direct search for constrained black box optimization","volume":"28","author":"Conn","year":"2013","journal-title":"Optim. Methods Softw."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1082","DOI":"10.1137\/S1052623496300507","article-title":"Pattern search algorithms for bound constrained minimization","volume":"9","author":"Lewis","year":"1999","journal-title":"SIAM J. Optim."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1137\/S1052623497331373","article-title":"Pattern search algorithms for linearly constrained minimization","volume":"10","author":"Lewis","year":"2000","journal-title":"SIAM J. Optim."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1137\/S1052623498339727","article-title":"A globally convergent augmented Lagrangian pattern search algorithm for optimization with general constraints and simple bounds","volume":"12","author":"Lewis","year":"2002","journal-title":"SIAM J. Optim."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Kolda, T., Lewis, R., and Torczon, V. (2006). A Generating Set Direct Search Augmented Lagrangian Algorithm for Optimization with a Combination of General and Linear Constraints.","DOI":"10.2172\/893121"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1137\/S105262340138983X","article-title":"A pattern search filter method for nonlinear programming without derivatives","volume":"14","author":"Audet","year":"2004","journal-title":"SIAM J. Optim."},{"key":"ref_26","first-page":"477","article-title":"Filter pattern search algorithms for mixed variable constrained optimization problems","volume":"3","author":"Abramson","year":"2007","journal-title":"Pac. J. Optim."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1023\/B:OPTE.0000033371.04406.e0","article-title":"Direct search methods for nonlinearly constrained optimization using filters and frames","volume":"5","author":"Dennis","year":"2004","journal-title":"Optim. Eng."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/moor.6.1.19","article-title":"Minimization by Random Search Techniques","volume":"6","author":"Solis","year":"1981","journal-title":"Math. Oper. Res."},{"key":"ref_29","unstructured":"Pearl, J. (1984). Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley Longman Publishing Co., Inc."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Michalewicz, Z., and Fogel, D.B. (2004). How to Solve It: Modern Heuristics, Springer. [2nd ed.].","DOI":"10.1007\/978-3-662-07807-5"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by Simulated Annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"B\u00e4ck, T. (1996). Evolutionary Algorithms in Theory and Pratice, Oxford University Press.","DOI":"10.1093\/oso\/9780195099713.001.0001"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Larra\u00f1aga, P., and Lozano, J.A. (2002). Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation, Kluwer.","DOI":"10.1007\/978-1-4615-1539-5"},{"key":"ref_34","unstructured":"Kennedy, J., and Eberhart, R. (December, January 27). Particle Swarm Optimization. Proceedings of the 1995 IEEE International Conference on Neural Networks, Perth, Australia."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","article-title":"Particle swarm optimization","volume":"1","author":"Poli","year":"2007","journal-title":"Swarm Intell."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","article-title":"Differential Evolution\u2014A Simple and Efficient Heuristic for global Optimization over Continuous Spaces","volume":"11","author":"Storn","year":"1997","journal-title":"J. Glob. Optim."},{"key":"ref_37","unstructured":"Chakraborty, U.K. (2008). Advances in Differential Evolution, Springer Publishing Company."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu Search\u2014Part I","volume":"2","author":"Glover","year":"1989","journal-title":"ORSA J. Comput."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Glover, F., and Laguna, M. (1997). Tabu Search, Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","article-title":"Ant system: Optimization by a colony of cooperating agents","volume":"26","author":"Dorigo","year":"1996","journal-title":"IEEE Trans. Syst. Man Cybern. Part B Cybern."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Dorigo, M., and St\u00fctzle, T. (2004). Ant Colony Optimization, Bradford Company.","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Paulavi\u010dius, R., and \u017dilinskas, J. (2014). Simplicial Global Optimization, Springer.","DOI":"10.1007\/978-1-4614-9093-7"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Sergeyev, Y.D., Strongin, R.G., and Lera, D. (2013). Introduction to Global Optimization Exploiting Space-Filling Curves, Springer.","DOI":"10.1007\/978-1-4614-8042-6"},{"key":"ref_44","unstructured":"Strongin, R.G., and Sergeyev, Y.D. (2013). Global Optimization with Non-Convex Constraints: Sequential and Parallel Algorithms, Springer."},{"key":"ref_45","unstructured":"Zhigljavsky, A., and \u017dilinskas, A. (2008). Stochastic Global Optimization, Springer."},{"key":"ref_46","unstructured":"Zhigljavsky, A.A. (2012). Theory of Global Random Search, Springer."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1137\/0709036","article-title":"A sequential method seeking the global maximum of a function","volume":"9","author":"Shubert","year":"1972","journal-title":"SIAM J. Numer. Anal."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1137\/040621132","article-title":"Global search based on efficient diagonal partitions and a set of Lipschitz constants","volume":"16","author":"Sergeyev","year":"2006","journal-title":"SIAM J. Optim."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.apnum.2009.10.004","article-title":"Lipschitz and H\u00f6lder global optimization using space-filling curves","volume":"60","author":"Lera","year":"2010","journal-title":"Appl. Numer. Math."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"1435","DOI":"10.1134\/S0005117913090014","article-title":"Lipschitz global optimization methods in control problems","volume":"74","author":"Kvasov","year":"2013","journal-title":"Autom. Remote Control"},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00941892","article-title":"Lipschitzian optimization without the Lipschitz constant","volume":"79","author":"Jones","year":"1993","journal-title":"J. Optim. Theory Appl."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1023\/A:1017930332101","article-title":"A locally-biased form of the DIRECT algorithm","volume":"21","author":"Gablonsky","year":"2001","journal-title":"J. Glob. Optim."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s10898-006-9029-9","article-title":"Additive scaling and the DIRECT algorithm","volume":"36","author":"Finkel","year":"2006","journal-title":"J. Glob. Optim."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10898-014-0180-4","article-title":"Globally-biased Disimpl algorithm for expensive global optimization","volume":"59","author":"Sergeyev","year":"2014","journal-title":"J. Glob. Optim."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s10898-013-0119-1","article-title":"A modified DIRECT algorithm with bilevel partition","volume":"60","author":"Liu","year":"2014","journal-title":"J. Glob. Optim."},{"key":"ref_56","first-page":"1","article-title":"The theory of filled function-method for finding global minimizers of nonlinearly constrained minimization problems","volume":"5","author":"Ge","year":"1987","journal-title":"J. Comput. Math."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0096-3003(90)90114-I","article-title":"The globally convexized filled functions for global optimization","volume":"35","author":"Ge","year":"1990","journal-title":"Appl. Math. Comput."},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0096-3003(99)00266-0","article-title":"Revised filled function methods for global optimization","volume":"119","author":"Han","year":"2001","journal-title":"Appl. Math. Comput."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0305-0548(02)00154-5","article-title":"A new filled function applied to global optimization","volume":"31","author":"Liu","year":"2004","journal-title":"Comput. Oper. Res."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"3114","DOI":"10.1016\/j.apm.2008.10.015","article-title":"New filled functions for nonsmooth global optimization","volume":"33","author":"Zhang","year":"2009","journal-title":"Appl. Math. Model."},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","article-title":"No Free Lunch Theorems for Optimization","volume":"1","author":"Wolpert","year":"1997","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_62","unstructured":"Hansen, N., Finck, S., Ros, R., and Auger, A. (2009). Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions, INRIA. Research Report RR-6829."},{"key":"ref_63","unstructured":"Mathworks (2010). MATLAB User\u2019s Guide (R2010a), The MathWorks, Inc."},{"key":"ref_64","unstructured":"Finkel, D.E. (2003). DIRECT Optimization Algorithm User Guide, Center for Research in Scientific Computation, North Carolina State University."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/9\/2\/40\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T04:03:53Z","timestamp":1717560233000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/9\/2\/40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,13]]},"references-count":64,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2016,6]]}},"alternative-id":["a9020040"],"URL":"https:\/\/doi.org\/10.3390\/a9020040","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,13]]}}}