Simulated annealing, random search, MultiStart or SAD? (Q1087138)
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 3987066
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simulated annealing, random search, MultiStart or SAD? |
scientific article; zbMATH DE number 3987066 |
Statements
Simulated annealing, random search, MultiStart or SAD? (English)
0 references
1987
0 references
The convergence properties of simulated annealing are compared to those of other general purpose global optimization algorithms on some simple examples. It appears that simulated annealing is frequently outperformed by the other procedures. Tentative analytical justifications are proposed and some implementation issues are discussed.
0 references
random research
0 references
random algorithms
0 references
stochastic optimization
0 references
non- homogeneous Markov chains
0 references
simulated annealing
0 references
global optimization
0 references
0.8355416655540466
0 references
0.8339295387268066
0 references
0.8339295387268066
0 references
0.8321812748908997
0 references
0.828588604927063
0 references
