On Uniform Covering, Adaptive Random Search and Raspberries

E.M.T. Hendrix, O. Klepper

Research output: Contribution to journalArticleAcademicpeer-review

18 Citations (Scopus)


The problem of generating a random sample over a level set, called Uniform Covering, is considered. A variant is discussed of an algorithm known as Pure Adaptive Search which is a global optimisation ideal with a desirable complexity. The algorithm of Uniform Covering by Probabilistic Rejection is discussed as an approach to the practical realisation of PAS. Consequences for the complexity and practical performance in comparison to other algorithms are illustrated
Original languageEnglish
Pages (from-to)143-163
JournalJournal of Global Optimization
Publication statusPublished - 2000


Dive into the research topics of 'On Uniform Covering, Adaptive Random Search and Raspberries'. Together they form a unique fingerprint.

Cite this