Simulated annealing with noisy or imprecise energy measurements (Q1106726): Difference between revisions

The annealing algorithm of \textit{S. Kirkpatrick, C. D. Gelatt} and \textit{M. Vecchi} [Science 220, 621-680 (1983)] is modified to allow for noisy or imprecise measurements of the energy cost function. This is important when the energy cannot be measured exactly or when it is computationally expensive to do so. Under suitable conditions on the noise/imprecision, it is shown that the modified algorithm exhibits the same convergence in probability to the globally minimum energy states as the annealing algorithm of \textit{B. Hajek} [Math. Oper. Res. 13, No.2, 311-329 (1988)]. Since the annealing algorithm will typically enter and exit the minimum energy states infinitely often with probability one, the minimum energy state visited by the annealing algorithm is usually tracked. The effect of using noisy or imprecise energy measurements on tracking the minimum energy state visited by the modified algorithms is examined.