{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T19:00:55Z","timestamp":1787770855892,"version":"build-2784847793"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,3,25]],"date-time":"2021-03-25T00:00:00Z","timestamp":1616630400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,3,25]],"date-time":"2021-03-25T00:00:00Z","timestamp":1616630400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2021,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Pattern Search is a family of gradient-free direct search methods for numerical optimisation problems. The characterising feature of pattern search methods is the use of multiple directions spanning the problem domain to sample new candidate solutions. These directions compose a matrix of potential search moves, that is the pattern. Although some fundamental studies theoretically indicate that various directions can be used, the selection of the search directions remains an unaddressed problem. The present article proposes a procedure for selecting the directions that guarantee high convergence\/high performance of pattern search. The proposed procedure consists of a fitness landscape analysis to characterise the geometry of the problem by sampling points and selecting those whose objective function values are below a threshold. The eigenvectors of the covariance matrix of this distribution are then used as search directions for the pattern search. Numerical results show that the proposed method systematically outperforms its standard counterpart and is competitive with modern complex direct search and metaheuristic methods.<\/jats:p>","DOI":"10.1007\/s42979-021-00513-y","type":"journal-article","created":{"date-parts":[[2021,3,25]],"date-time":"2021-03-25T22:57:59Z","timestamp":1616713079000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Generalised Pattern Search Based on Covariance Matrix Diagonalisation"],"prefix":"10.1007","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6100-6532","authenticated-orcid":false,"given":"Ferrante","family":"Neri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shahin","family":"Rostami","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,3,25]]},"reference":[{"key":"513_CR1","volume-title":"On an iterative method for finding a local minimum of a function of more than one variable","author":"E Beale","year":"1958","unstructured":"Beale E. On an iterative method for finding a local minimum of a function of more than one variable. Tech. rep.: Princeton University; 1958."},{"key":"513_CR2","volume-title":"Non-linear optimisation techniques","author":"MJ Box","year":"1969","unstructured":"Box MJ, Davies D, Swann WH. Non-linear optimisation techniques. London: Oliver & Boyd; 1969."},{"key":"513_CR3","volume-title":"Algorithms for minimization without derivatives","author":"RP Brent","year":"1973","unstructured":"Brent RP. Algorithms for minimization without derivatives. Englewood Cliffs: Prentice-Hall; 1973."},{"issue":"1","key":"513_CR4","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/TSMCB.2006.883271","volume":"37","author":"A Caponio","year":"2007","unstructured":"Caponio A, Cascella GL, Neri F, Salvatore N, Sumner M. A fast adaptive memetic algorithm for on-line and off-line control design of PMSM drives. IEEE Trans Syst Man Cybern Part B. 2007;37(1):28\u201341.","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"key":"513_CR5","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.ins.2012.11.017","volume":"227","author":"F Caraffini","year":"2013","unstructured":"Caraffini F, Neri F, Iacca G, Mol A. Parallel memetic structures. Inf Sci. 2013;227:60\u201382.","journal-title":"Inf Sci"},{"issue":"12","key":"513_CR6","doi-asserted-by":"publisher","first-page":"2235","DOI":"10.1007\/s00500-013-1106-7","volume":"17","author":"F Caraffini","year":"2013","unstructured":"Caraffini F, Neri F, Passow BN, Iacca G. Re-sampled inheritance search: high performance despite the simplicity. Soft Comput. 2013;17(12):2235\u201356.","journal-title":"Soft Comput"},{"key":"513_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2013.12.044","volume":"265","author":"F Caraffini","year":"2014","unstructured":"Caraffini F, Neri F, Picinali L. An analysis on separability for memetic computing automatic design. Inf Sci. 2014;265:1\u201322.","journal-title":"Inf Sci"},{"key":"513_CR8","doi-asserted-by":"crossref","unstructured":"Cartis C, Fiala J, Marteau B, Roberts L. Improving the flexibility and robustness of model-based derivative-free optimization solvers. ACM Trans Math Softw. 2019;45(3):32:1\u201332:41.","DOI":"10.1145\/3338517"},{"issue":"4","key":"513_CR9","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s12532-019-00161-7","volume":"11","author":"C Cartis","year":"2019","unstructured":"Cartis C, Roberts L. A derivative-free gauss-newton method. Math Program Comput. 2019;11(4):631\u201374.","journal-title":"Math Program Comput."},{"key":"513_CR10","series-title":"MPS-SIAM book series on optimization","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to derivative-free optimization","author":"AR Conn","year":"2009","unstructured":"Conn AR, Scheinberg K, Vicente LN. Introduction to derivative-free optimization. MPS-SIAM book series on optimization. London: SIAM; 2009."},{"key":"513_CR11","unstructured":"Davidon W. Variable metric method for minimization. SIAM Journal of Optimization 1, 1\u201317 (1991). The article was originally published as Argonne National Laboratory Research and Development Report 5990, May 1959 (revised November 1959)"},{"issue":"4","key":"513_CR12","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1137\/0801027","volume":"1","author":"J Dennis Jr","year":"1991","unstructured":"Dennis J Jr, Torczon V. Direct search methods on parallel machines. SIAM J Optim. 1991;1(4):448\u201374.","journal-title":"SIAM J Optim"},{"key":"513_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44874-8","volume-title":"Introduction to evolutionary computation","author":"AE Eiben","year":"2015","unstructured":"Eiben AE, Smith JE. Introduction to evolutionary computation. 2nd ed. Berlin: Springer; 2015.","edition":"2"},{"key":"513_CR14","volume-title":"An introduction to probability theory and its applications","author":"W Feller","year":"1968","unstructured":"Feller W. An introduction to probability theory and its applications, vol. 1. Amsterdam: Wiley; 1968."},{"key":"513_CR15","unstructured":"Fisher RA. The design of experiments, 9th edn. Macmillan (1935); 1971."},{"key":"513_CR16","volume-title":"Practical methods of optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher R. Practical methods of optimization. 2nd ed. New York: Wiley; 1987.","edition":"2"},{"issue":"10","key":"513_CR17","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1007\/s00500-008-0392-y","volume":"13","author":"S Garcia","year":"2008","unstructured":"Garcia S, Fernandez A, Luengo J, Herrera F. A study of statistical techniques and performance measures for genetics-based machine learning: accuracy and interpretability. Soft Comput. 2008;13(10):959\u201377.","journal-title":"Soft Comput"},{"key":"513_CR18","unstructured":"Hansen, N. The CMA evolution strategy. 2012.http:\/\/www.lri.fr\/~hansen\/cmaesintro.html"},{"key":"513_CR19","doi-asserted-by":"crossref","unstructured":"Hansen N, Auger A, Ros R, Finck S, Po\u0161\u00edk, P. Comparing results of 31 algorithms from the black-box optimization benchmarking bbob-2009. In: GECCO\u201910: Proceedings of the 12th annual conference companion on Genetic and evolutionary computation, pp. 1689\u20131696. ACM 2010.","DOI":"10.1145\/1830761.1830790"},{"key":"513_CR20","doi-asserted-by":"crossref","unstructured":"Hansen N, Ostermeier A. Completely derandomized self-adaptation in evolution strategies. Evol Comput. 2001;9(2):159\u201395.","DOI":"10.1162\/106365601750190398"},{"key":"513_CR21","first-page":"3","volume-title":"Recent advances in memetic algorithms","author":"WE Hart","year":"2004","unstructured":"Hart WE, Krasnogor N, Smith JE. Memetic evolutionary algorithms. In: Hart WE, Krasnogor N, Smith JE, editors. Recent advances in memetic algorithms. Berlin: Springer; 2004. p. 3\u201327."},{"issue":"2","key":"513_CR22","first-page":"65","volume":"6","author":"S Holm","year":"1979","unstructured":"Holm S. A simple sequentially rejective multiple test procedure. Scand J Stat. 1979;6(2):65\u201370.","journal-title":"Scand J Stat"},{"key":"513_CR23","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1145\/321062.321069","volume":"8","author":"R Hooke","year":"1961","unstructured":"Hooke R, Jeeves TA. Direct search solution of numerical and statistical problems. J ACM. 1961;8:212\u201329.","journal-title":"J ACM"},{"key":"513_CR24","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ins.2011.11.025","volume":"188","author":"G Iacca","year":"2012","unstructured":"Iacca G, Neri F, Mininno E, Ong YS, Lim MH. Ockham\u2019s Razor in memetic computing: three stage optimal memetic exploration. Inf Sci. 2012;188:17\u201343.","journal-title":"Inf Sci"},{"key":"513_CR25","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1007\/s00500-016-2397-2","volume":"22","author":"ND Jana","year":"2018","unstructured":"Jana ND, Sil J, Das S. Continuous fitness landscape analysis using a chaos-based random walk algorithm. Soft Comput. 2018;22:921\u201348.","journal-title":"Soft Comput"},{"key":"513_CR26","unstructured":"Jolliffe IT. Principal Component Analysis, 2nd edn. Springer Series in Statistics, 2002. Springer, New York."},{"issue":"6","key":"513_CR27","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/366604.366632","volume":"6","author":"F Kaupe Jr","year":"1963","unstructured":"Kaupe F Jr. Algorithm 178: direct search. Commun ACM. 1963;6(6):313\u20134.","journal-title":"Commun ACM"},{"key":"513_CR28","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC. Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks,1995; pp. 1942\u20131948.","DOI":"10.1109\/ICNN.1995.488968"},{"key":"513_CR29","doi-asserted-by":"crossref","unstructured":"Lewis RM, Torczon V, Trosset MW. Direct search methods: then and now. J Comput Appl Math 2000;124(1), 191\u2013207. Numerical Analysis 2000. Vol. IV: Optimization and Nonlinear Equations","DOI":"10.1016\/S0377-0427(00)00423-4"},{"key":"513_CR30","unstructured":"Liang J, Qu B, Suganthan P, Hern\u00e1ndez-D\u00edaz A. Problem definitions and evaluation criteria for the cec 2013 special session on real-parameter optimization, 2013."},{"key":"513_CR31","unstructured":"Liang JJ, Qu BY, Suganthan PN, Hern\u00e1ndez-D\u00edaz AG. Problem Definitions and Evaluation Criteria for the CEC 2013 Special Session on Real-Parameter Optimization. Tech. Rep. 201212, Zhengzhou University and Nanyang Technological University, Zhengzhou China and Singapore, 2013."},{"key":"513_CR32","doi-asserted-by":"crossref","unstructured":"Malan KM, Engelbrecht AP. Quantifying ruggedness of continuous landscapes using entropy. In: 2009 IEEE Congress on Evolutionary Computation, 2009; pp. 1440\u20131447.","DOI":"10.1109\/CEC.2009.4983112"},{"key":"513_CR33","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.ins.2013.04.015","volume":"241","author":"KM Malan","year":"2013","unstructured":"Malan KM, Engelbrecht AP. A survey of techniques for characterising fitness landscapes and some possible ways forward. Inf Sci. 2013;241:148\u201363.","journal-title":"Inf Sci"},{"key":"513_CR34","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Lewis A. The whale optimization algorithm. Adv Eng Softw. 2016;95:51\u201367.","journal-title":"Adv Eng Softw"},{"issue":"1","key":"513_CR35","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1162\/evco.2010.18.1.18102","volume":"18","author":"D Molina","year":"2010","unstructured":"Molina D, Lozano M, Garcia-Martinez C, Herrera F. Memetic algorithms for continuous optimization based on local search chains. Evol Comput. 2010;18(1):27\u201363.","journal-title":"Evol Comput"},{"key":"513_CR36","doi-asserted-by":"crossref","unstructured":"Moser I. Hooke-jeeves revisited. In: Proceedings of the Eleventh Conference on Congress on Evolutionary Computation, CEC\u201909, 2009; pp. 2670\u20132676. IEEE Press.","DOI":"10.1109\/CEC.2009.4983277"},{"key":"513_CR37","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"A Nelder","year":"1965","unstructured":"Nelder A, Mead R. A simplex method for function optimization. Comput J. 1965;7:308\u201313.","journal-title":"Comput J"},{"key":"513_CR38","doi-asserted-by":"crossref","unstructured":"Neri F. Linear algebra for computational sciences and engineering, 2nd edn. Springer, New York, 2019.","DOI":"10.1007\/978-3-030-21321-3"},{"key":"513_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2011.11.003","volume":"2","author":"F Neri","year":"2012","unstructured":"Neri F, Cotta C. Memetic algorithms and memetic computing optimization: a literature review. Swarm Evolut Comput. 2012;2:1\u201314.","journal-title":"Swarm Evolut Comput"},{"key":"513_CR40","doi-asserted-by":"crossref","unstructured":"Neri F, Cotta C, Moscato P. Handbook of Memetic Algorithms, Studies in Computational Intelligence, vol. 379. Springer, New York, 2011.","DOI":"10.1007\/978-3-642-23247-3"},{"key":"513_CR41","doi-asserted-by":"crossref","unstructured":"Neri F, Garcia XdT. Cascella GL, Salvatore N. Surrogate assisted local search on PMSM drive design. COMPEL: Int J Comput Math Electr Electron Eng. 2008;27(3):573\u2013592.","DOI":"10.1108\/03321640810861043"},{"key":"513_CR42","doi-asserted-by":"crossref","unstructured":"Neri F, Rostami S. A local search for numerical optimisation based on covariance matrix diagonalisation. In: Castillo PA, Laredo JLJ, de\u00a0Vega FF editors. Applications of Evolutionary Computation - 23rd European Conference, EvoApplications 2020, Held as Part of EvoStar 2020, Seville, Spain, April 15\u201317, 2020, Proceedings, Lecture Notes in Computer Science, Springer, New York, 2020;12104, 3\u201319.","DOI":"10.1007\/978-3-030-43722-0_1"},{"issue":"1\u20132","key":"513_CR43","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10462-009-9137-2","volume":"33","author":"F Neri","year":"2010","unstructured":"Neri F, Tirronen V. Recent advances in differential evolution: a review and experimental analysis. Artif Intell Rev. 2010;33(1\u20132):61\u2013106.","journal-title":"Artif Intell Rev"},{"key":"513_CR44","unstructured":"Press WH, Teukolsky SA, Vetterling WT, Flannery BP. Numerical recipes in C: the art of scientific computing, 2nd edn. Cambridge University Press, New York, NY (1992)"},{"issue":"2","key":"513_CR45","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1016\/S0096-3003(02)00629-X","volume":"146","author":"B Raphael","year":"2003","unstructured":"Raphael B, Smith I. A direct stochastic algorithm for global search. Appl Math Comput. 2003;146(2):729\u201358.","journal-title":"Appl Math Comput"},{"issue":"2","key":"513_CR46","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1016\/j.amc.2010.06.027","volume":"217","author":"A Rios-Coelho","year":"2010","unstructured":"Rios-Coelho A, Sacco W, Henderson N. A metropolis algorithm combined with hooke-jeeves local search method applied to global optimization. Appl Math Comput. 2010;217(2):843\u201353.","journal-title":"Appl Math Comput"},{"key":"513_CR47","first-page":"285","volume":"9","author":"P Stanimirovic","year":"1999","unstructured":"Stanimirovic P, Tasic M, Ristic M. Symbolic implementation of the hooke-jeeves method. Yugoslav J Oper Res. 1999;9:285\u2013301.","journal-title":"Yugoslav J Oper Res"},{"issue":"1","key":"513_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S1052623493250780","volume":"7","author":"V Torczon","year":"1997","unstructured":"Torczon V. On the convergence of pattern search algorithms. SIAM J Optim. 1997;7(1):1\u201325.","journal-title":"SIAM J Optim"},{"key":"513_CR49","unstructured":"Tseng LY, Chen C. Multiple trajectory search for Large Scale Global Optimization. In: Proceedings of the IEEE congress on evolutionary computation, 2008; pp. 3052\u20133059."},{"issue":"4","key":"513_CR50","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10710-009-9089-y","volume":"10","author":"M Weber","year":"2009","unstructured":"Weber M, Neri F, Tirronen V. Distributed differential evolution with explorative\u2013exploitative population families. Genet Program Evolvable Mach. 2009;10(4):343\u201371.","journal-title":"Genet Program Evolvable Mach"},{"issue":"6","key":"513_CR51","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon F. Individual comparisons by ranking methods. Biometr Bull. 1945;1(6):80\u20133.","journal-title":"Biometr Bull"},{"key":"513_CR52","doi-asserted-by":"crossref","unstructured":"Zhang G, Rong H, Neri F, P\u00e9rez-Jim\u00e9nez MJ. An optimization spiking neural P system for approximately solving combinatorial optimization problems. Int J Neural Sys. 2014; 24(5).","DOI":"10.1142\/S0129065714400061"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-021-00513-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-021-00513-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-021-00513-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T21:25:53Z","timestamp":1724707553000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-021-00513-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,25]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["513"],"URL":"https:\/\/doi.org\/10.1007\/s42979-021-00513-y","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"value":"2662-995X","type":"print"},{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,25]]},"assertion":[{"value":"12 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"This study was funded by the institutions indicated in the list of affiliations.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}},{"value":"The authors declare that they have no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"171"}}