Simple conditions for the convergence of simulated annealing type algorithms (Q4248124)
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 1295292
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simple conditions for the convergence of simulated annealing type algorithms |
scientific article; zbMATH DE number 1295292 |
Statements
Simple conditions for the convergence of simulated annealing type algorithms (English)
0 references
15 March 2000
0 references
Markov chain
0 references
ergodicity
0 references
probability
0 references
simulated annealing type algorithms
0 references
global minimization
0 references
convergence
0 references
0.861518383026123
0 references
0.8470613360404968
0 references
0.8452258706092834
0 references
0.843058705329895
0 references
0.8428419828414917
0 references
