Asymptotical behaviour of several interacting annealing processes

Abstract

We prove that the optimal convergence speed exponent for parallel annealing based on periodically interacting multiple searches with time periodr is always worse than for independent multiple searches whenever the cost function has only one global minimum. Our proofs will be based on large deviation estimates coming from the theory of generalized simulated annealing (G.S.A.).