Convergence of the simulated annealing algorithm for continuous global optimization (Q1573995)
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 1486613
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence of the simulated annealing algorithm for continuous global optimization |
scientific article; zbMATH DE number 1486613 |
Statements
Convergence of the simulated annealing algorithm for continuous global optimization (English)
0 references
30 September 2001
0 references
In this paper, the convergence behavior of a class of simulated annealing (SA) algorithms for continuous global optimization is analyzed. The SA algorithms under consideration uses a temperature-dependent probability density function to generate the random trial points from the current iteration point and an annealing time-dependent temperature updating function to reduce the value of the temperature after each random trial point is generated. The author provides a convergence analysis and promises further research including numerical experiments.
0 references
simulated annealing
0 references
cooling schedule
0 references
global optimization
0 references
convergence analysis
0 references
0 references
0.8853930234909058
0 references
0.8851787447929382
0 references
0.8162488341331482
0 references
0.8139824271202087
0 references
