How long should we run a stochastic global optimisation algorithm such as simulated annealing? How should we tune such an algorithm? This paper proposes an approach to the study of these questions through successive approximation of a generic stochastic global optimisation algorithm with a sequence of stochastic processes, culminating in a backtracking adaptive search process. Our emerging understanding of backtracking adaptive search can thus be used to study the original algorithm. The first approximation, the averaged range process, has the same expected number of iterations to convergence as the original process.
|Number of pages||14|
|Journal||Journal of Global Optimization|
|Publication status||Published - 2002|
- Adaptive search
- Markov chain
- Stochastic approximation
- Stochastic process