Simulated annealing methods with general acceptance probabilities (Q3764964)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4022276
Language Label Description Also known as
default for all languages
No label defined
    English
    Simulated annealing methods with general acceptance probabilities
    scientific article; zbMATH DE number 4022276

      Statements

      Simulated annealing methods with general acceptance probabilities (English)
      0 references
      0 references
      0 references
      1987
      0 references
      simulated annealing methods
      0 references
      global optima
      0 references
      convergence of the algorithm to a global optimum
      0 references
      rate of convergence
      0 references
      This paper presents a probabilistic analysis of various non-static implementations of simulated annealing methods when applied to a general discrete optimization problem. The authors identified necessary and sufficient conditions for the following properties: (1) reachability of the set of global optima; (2) asymptotic independence of starting solutions; (3) convergence of solutions in distribution; (4) convergence of the algorithm to a global optimum. In addition, for annealing methods satisfying the third condition they found a bound on the rate of convergence.
      0 references

      Identifiers