期刊
THEORETICAL COMPUTER SCIENCE
卷 334, 期 1-3, 页码 35-69出版社
ELSEVIER
DOI: 10.1016/j.tcs.2004.11.017
关键词
evolution strategies; convergence; Markov chains; Foster-Lyapunov drift conditions
This paper investigates theoretically the (1, lambda)-SA-ES on the well known sphere function. We prove sufficient conditions on the parameters of the algorithm ensuring the convergence of 1/n ln(parallel to Xn parallel to), where X-n is the parent at generation n. This in turn guarantees the asymptotic log-linear convergence or divergence of the algorithm. The technique used for this analysis calls upon the theory of Markov chains on a continuous state space and on the so-called Foster-Lyapunov drift conditions. Those conditions enable us to derive practical conditions that prove stability properties of Markov chains. (c) 2005 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据