An adaptive simulated annealing algorithm. (Q1888770)

Inspired by the idea of the Metropolis algorithm, the authors propose a new sample adaptive simulated annealing algorithm on finite state space. The algorithm can be considered as a substitute of the annealing of iterative stochastic schemes in case of finite state space and can be hopefully extended to the denumerable state case with some modifications. The convergence of the algorithm is proved.