On the convergence rate of the simulated annealing algorithm

被引：0
|
作者：
A. S. Tikhomirov
机构：
[1] Novgorod State University,
来源：
Computational Mathematics and Mathematical Physics | 2010年 / 50卷
关键词：
simulated annealing algorithm; random search; global optimization; estimate of convergence rate;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The convergence rate of the simulated annealing algorithm is examined. It is shown that, if the objective function is nonsingular, then the number of its evaluations required to obtain the desired accuracy ɛ in the solution can be a slowly (namely, logarithmically) growing function as ɛ approaches zero.
引用
收藏
页码：19 / 31
页数：12
相关论文
共 50 条
12345