Abstract
We discuss the noisy optimisation problem, in which function evaluations are subject to random noise. Adaptation of pure random search to noisy optimisation by repeated sampling is considered. We introduce and exploit an improving bias condition on noise-affected pure random search algorithms. Two such algorithms are considered; we show that one requires infinite expected work to proceed, while the other is practical.
Original language | English |
---|---|
Pages (from-to) | 601-612 |
Number of pages | 12 |
Journal | Journal of Global Optimization |
Volume | 31 |
Issue number | 4 |
DOIs | |
Publication status | Published - Apr 2005 |