Expected search duration for finite backtracking adaptive search

Authors:
D. L. J. Alexander;D. W. Bulger;G. R. Wood
Affiliations:
Institute of Information Sciences and Technology, Massey University, Palmerston North, New Zealand;Institute of Information Sciences and Technology, Massey University, Palmerston North, New Zealand;Department of Statistics, Macquarie University, NSW 2109, Australia
Venue:
Journal of Algorithms
Year:
2003

Citing 4
Cited 0

Pure adaptive search in global optimization

Mathematical Programming: Series A and B
Pure adaptive search for finite global optimization

Mathematical Programming: Series A and B
Implementing pure adaptive search for global optimization using Markov chain sampling

Journal of Global Optimization
Approximation of the distribution of convergence times for stochastic global optimisation

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Backtracking adaptive search is an optimisation algorithm which generalises pure adaptive search and hesitant adaptive search. This paper considers the number of iterations for which the algorithm runs, on a problem with finitely many range levels, in order to reach a sufficiently extreme objective function level. A difference equation for the expectation of this quantity is derived and solved. Several examples of backtracking adaptive search on finite problems are presented, including special cases that have received attention in earlier papers.