On success rates for controlled random search

E.M.T. Hendrix, P.M. Ortigosa, I. Garcia

Research output: Contribution to journalArticleAcademicpeer-review

20 Citations (Scopus)

Abstract

Controlled Random Search (CRS) is a simple population based algorithm which despite its attractiveness for practical use, has never been very popular among researchers on Global Optimization due to the difficulties in analysing the algorithm. In this paper, a framework to study the behaviour of algorithms in general is presented and embedded into the context of our view on questions in Global Optimization. By using as a reference a theoretical ideal algorithm called N-points Pure Adaptive Search (NPAS) some new analytical results provide bounds on speed of convergence and the Success Rate of CRS in the limit once it has settled down into simple behaviour. To relate the performance of the algorithm to characteristics of functions to be optimized, constructed simple test functions, called extreme cases, are used
Original languageEnglish
Pages (from-to)239-263
JournalJournal of Global Optimization
Volume21
Issue number3
DOIs
Publication statusPublished - 2001

Fingerprint Dive into the research topics of 'On success rates for controlled random search'. Together they form a unique fingerprint.

  • Cite this