Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
  1. Home
  2. Probability Theory and Related Fields
  3. Article
The energy transformation method for the Metropolis algorithm compared with Simulated Annealing
Download PDF
Download PDF
  • Article
  • Published: January 1998

The energy transformation method for the Metropolis algorithm compared with Simulated Annealing

  • Olivier Catoni1 

Probability Theory and Related Fields volume 110, pages 69–89 (1998)Cite this article

Summary.

We present and analyze a new speed-up technique for Monte Carlo optimization: the Iterated Energy Transformation algorithm, where the Metropolis algorithm is used repeatedly with more and more favourable energy functions derived from the original one by increasing transformations. We show that this method allows a better speed-up than Simulated Annealing when convergence speed is measured by the probability of failure of the algorithm after a large number of iterations. We study also the limit of a large state space in the special case when the energy is made of a sum of independent terms. We show that the convergence time of the I.E.T. algorithm is polynomial in the size (number of coordinates) of the problem, but with a worse exponent than for Simulated Annealing. This indicates that the I.E.T. algorithm is well suited for moderate size problems but not for too large ones. The independent component case is a good model for the end of many optimization processes, when at low temperature a neighbourhood of a local minimum is explored by small and far apart modifications of the current solution. We show that in this case both global optimization methods, Simulated Annealing and the I.E.T. algorithm, are less efficient than repeated local stochastic optimizations. Using the general concept of “slow stochastic optimization algorithm”, we show that any “slow” global optimization scheme should be followed by a local one to perform the last approach to a minimum.

Download to read the full article text

Working on a manuscript?

Avoid the common mistakes

Author information

Authors and Affiliations

  1. DIAM – Intelligence Artificielle et Mathématiques, Laboratoire de Mathématiques de l'Ecole Normale Supérieure, UA 762 du CNRS, 45, rue d'Ulm, F-75 005 Paris, France, , , , , , FR

    Olivier Catoni

Authors
  1. Olivier Catoni
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: 22 November 1994 / In revised form: 14 July 1997

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Catoni, O. The energy transformation method for the Metropolis algorithm compared with Simulated Annealing. Probab Theory Relat Fields 110, 69–89 (1998). https://doi.org/10.1007/s004400050145

Download citation

  • Issue Date: January 1998

  • DOI: https://doi.org/10.1007/s004400050145

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

  • AMS Subject Classification(1991): 60J10
  • 90C42
Download PDF

Working on a manuscript?

Avoid the common mistakes

Advertisement

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature