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
相关论文
共 11 条
  • [1] Ermakov S. M.(1989)Comparison of Some Global Search Procedures Zh. Vychisl. Mat. Mat. Fiz. 29 163-170
  • [2] Zhiglyavskii A. A.(1999)Rates of Convergence for a Class of Global Stochastic Optimization Algorithms SIAM J. Optim. 10 99-120
  • [3] Kondratovich M. V.(2007)Monotonous Random Search on a Torus: Integral Upper Bounds for the Complexity J. Statistical Planning and Inference 137 4031-4047
  • [4] Yin G.(2006)On the Markov Homogeneous Optimization Method Zh. Vychisl. Mat. Mat. Fiz. 46 379-394
  • [5] Tikhomirov A.(2007)On the Convergence Rate of the Markov Homogeneous Monotone Optimization Method Zh. Vychisl. Mat. Mat. Fiz. 47 817-828
  • [6] Stojunina T.(1993)Speed of Convergence as a Function of Given Accuracy for Random Search Methods Acta Appl. Math. 33 89-108
  • [7] Nekrutkin V.(undefined)undefined undefined undefined undefined-undefined
  • [8] Tikhomirov A. S.(undefined)undefined undefined undefined undefined-undefined
  • [9] Tikhomirov A. S.(undefined)undefined undefined undefined undefined-undefined
  • [10] Nekrutkin V. V.(undefined)undefined undefined undefined undefined-undefined
12