Abstract
The algorithm known as Pure Adaptive Search is a global optimisation ideal with desirable complexity. In this paper we temper it to a framework we term Somewhat Adaptive Search. This retains the desirable complexity, but allows scope for a practical realisation. We introduce a new algorithm termed Pure Localisation Search which attempts to reach the practical ideal. For a certain class of one variable functions the gap is bridged.
Original language | English |
---|---|
Pages (from-to) | 93-110 |
Number of pages | 18 |
Journal | Journal of Global Optimization |
Volume | 7 |
Issue number | 1 |
DOIs | |
Publication status | Published - Jul 1995 |
Keywords
- complexity
- Global optimisation
- localisation
- random search
- stochastic