Abstract
We use Sobolev inequalities to study the simulated annealing algorithm. This approach takes advantage of the local time reversibility of the process and yields the optimal “freezing schedule” as well as quantitative information about the rate at which the process is tending to its ground state.
Similar content being viewed by others
References
Chiang, T.-S., Chow, Y.: On eigenvalues and annealing rates, (to appear in Math. Oper. Res.): On the convergence rate of a special class of annealing processes. (to appear in Soochow J. Math.): On the convergence rate of annealing process. Preprint
Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. Pattern Anal. Mach. Intell.6, 721–741 (1984)
Geman, S., Hwang C.-R.: Diffusions for global optimization: Preprint (1984)
Gidas, B.: Non-stationary Markov chains and convergence of the annealing algorithm. J. Stat. Phys.39, 73–131 (1985)
Goldstein, L.: Mean square rates of convergence in the continuous time simulated annealing algorithm onR d. Preprint (1986)
Gross, L.: Logarithmic Sobolev inequalities, Am. J. Math.97, 1061–1083 (1976)
Hajek, B.: Cooling schedules for optimal annealing. Preprint submitted to Math. Oper. Res. (1985)
Kirkpatrick, S., Gelett, C. D., Vecchi, M. P.: Optimization by simulated annealing. Science220, 621–680 (1983)
Stroock, D.: An introduction to the theory of large deviations. Berlin, Heidelberg, New York: Springer 1984
Author information
Authors and Affiliations
Additional information
Communicated by A. Jaffe
Research supported in part by NSF Grant DMS-8609944
Research supported in part by NSF Grant DMS-8611487 and ARO DAAL03-86-K-0171
Rights and permissions
About this article
Cite this article
Holley, R., Stroock, D. Simulated annealing via Sobolev inequalities. Commun.Math. Phys. 115, 553–569 (1988). https://doi.org/10.1007/BF01224127
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01224127