Simulated annealing via Sobolev inequalities (Q1102047): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Nonstationary Markov chains and convergence of the annealing algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Logarithmic Sobolev Inequalities / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimization by Simulated Annealing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An introduction to the theory of large deviations / rank | |||
Normal rank | |||
Revision as of 16:03, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simulated annealing via Sobolev inequalities |
scientific article |
Statements
Simulated annealing via Sobolev inequalities (English)
0 references
1988
0 references
The new idea of the paper is to use the Sobolev inequality and logarithmic Sobolev inequality to study the simulated annealing algorithm. Even though the state space treated here is finite many results are meaningful for other cases. The approach yields some information about the rate at which the annealing process is tending to the minima of the given cost function. In fact, it is proved that the estimates for the rate are optimal in some sense.
0 references
Sobolev inequality
0 references
simulated annealing algorithm
0 references
rate at which the annealing process is tending to the minima
0 references
