IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v35y1990i2p309-313.html
   My bibliography  Save this article

Laws of large numbers for the annealing algorithm

Author

Listed:
  • Gantert, Nina

Abstract

In this paper we establish a weak and a strong law of large numbers for the algorithm of simulated annealing. To this end, we recall laws of large numbers for time-inhomogeneous Markov chains which are formulated in terms of Dobrushin's contraction coefficients, and we show how they lead to corresponding cooling constants in the annealing algorithm.

Suggested Citation

  • Gantert, Nina, 1990. "Laws of large numbers for the annealing algorithm," Stochastic Processes and their Applications, Elsevier, vol. 35(2), pages 309-313, August.
    • Handle: RePEc:eee:spapps:v:35:y:1990:i:2:p:309-313
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0304-4149(90)90009-H
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zach Dietz & William Lippitt & Sunder Sethuraman, 2023. "Stick-Breaking processes, Clumping, and Markov Chain Occupation Laws," Sankhya A: The Indian Journal of Statistics, Springer;Indian Statistical Institute, vol. 85(1), pages 129-171, February.
    2. János Engländer & Stanislav Volkov, 2018. "Turning a Coin over Instead of Tossing It," Journal of Theoretical Probability, Springer, vol. 31(2), pages 1097-1118, June.
    3. Miclo, Laurent, 1995. "Remarques sur l'ergodicité des algorithmes de recuit simulé sur un graphe," Stochastic Processes and their Applications, Elsevier, vol. 58(2), pages 329-360, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:35:y:1990:i:2:p:309-313. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.