Nonautonomous Stochastic Search in Global Optimization

被引:4
作者
Ombach, Jerzy [1 ]
Tarlowski, Dawid [1 ]
机构
[1] Uniwersytet Jagiellonski, Inst Matematyki, Wydzial Matematyki & Informatyki, PL-30348 Krakow, Poland
关键词
Global optimization; Stochastic algorithm; Random search; Foias operator; Lyapunov function; CONVERGENCE;
D O I
10.1007/s00332-011-9112-3
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We present a general method how to prove convergence of a sequence of random variables generated by a nonautonomous scheme of the form X-t = T-t(Xt-1, Y-t), where Y-t represents randomness, used as an approximation of the set of solutions of the global optimization problem with a continuous cost function. We show some of its applications.
引用
收藏
页码:169 / 185
页数:17
相关论文
共 17 条
  • [1] GEM: A novel evolutionary optimization method with improved neighborhood search
    Ahrari, A.
    Shariat-Panahi, M.
    Atai, A. A.
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2009, 210 (02) : 376 - 386
  • [2] Grenade Explosion Method-A novel tool for optimization of multimodal functions
    Ahrari, Ali
    Atai, Ali A.
    [J]. APPLIED SOFT COMPUTING, 2010, 10 (04) : 1132 - 1140
  • [3] [Anonymous], 2004, Springer Texts in Statistics
  • [4] [Anonymous], 1998, WILEY PS TX
  • [5] [Anonymous], 1999, CONVERGE PROBAB MEAS
  • [6] On accelerated random search
    Appel, MJ
    Labarre, R
    Radulovic, D
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2004, 14 (03) : 708 - 731
  • [7] Iterated random functions
    Diaconis, P
    Freedman, D
    [J]. SIAM REVIEW, 1999, 41 (01) : 45 - 76
  • [8] Kennedy J., 1995, 1995 IEEE International Conference on Neural Networks Proceedings (Cat. No.95CH35828), P1942, DOI 10.1109/ICNN.1995.488968
  • [9] Lasota A., 1994, Applied Mathematical Sciences, V2nd ed.
  • [10] Ljung L., 1992, DMV SEMINAR, V17