### Abstract

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.

Original language | English |
---|---|

Article number | A016 |

Pages (from-to) | 271-284 |

Number of pages | 14 |

Journal | Journal of Global Optimization |

Volume | 22 |

Issue number | 1-4 |

Publication status | Published - 2002 |

Externally published | Yes |

### Keywords

- Adaptive search
- Markov chain
- Optimization
- Stochastic approximation
- Stochastic process

## Fingerprint Dive into the research topics of 'Approximation of the distribution of convergence times for stochastic global optimisation'. Together they form a unique fingerprint.

## Cite this

Wood, G. R., Alexander, D. L., & Bulger, D. W. (2002). Approximation of the distribution of convergence times for stochastic global optimisation.

*Journal of Global Optimization*,*22*(1-4), 271-284. [A016].