Simulated annealing, random search, MultiStart or SAD? (Q1087138): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Jean-Bernard Lasserre / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Pravin P. Varaiya / rank | |||
Normal rank | |||
Revision as of 08:04, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simulated annealing, random search, MultiStart or SAD? |
scientific article |
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
