Hesitant adaptive search: the distribution of the number of iterations to convergence

Hesitant adaptive search is a stochastic optimisation procedure which accommodates hesitation, or pausing, at objective function values. It lies between pure adaptive starch (which strictly improves at each iteration) and simulated annealing with constant temperature (which allows backtracking, or the acceptance of worse function values). In this paper we build on an earlier work and make two contributions; first, we link hesitant adaptive search to standard counting process theory, and second, we use this to derive the exact distribution of the number of iterations of hesitant adaptive search to termination.