首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Nonautonomous Stochastic Search in Global Optimization
Authors:Jerzy Ombach  Dawid Tar?owski
Institution:1. Instytut Matematyki, Wydzia? Matematyki i Informatyki, Uniwersytet Jagiello??ski, ul. ?ojasiewicza 6, 30 348, Krak??w, Poland
Abstract: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 (X t−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.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号