期刊
SWARM AND EVOLUTIONARY COMPUTATION
卷 52, 期 -, 页码 -出版社
ELSEVIER
DOI: 10.1016/j.swevo.2019.100606
关键词
Particle swarm optimization; Semistability; Paracontraction
In this paper, the convergence issue of the Particle Swarm Optimization (PSO) algorithm is investigated. Most of the models of PSO algorithms are time-invariant linear models with the assumption the local and global best solutions do not change, i.e., the stagnation assumption. However, in this paper, a discrete-time switched linear model is introduced to study the stability and convergence of the PSO algorithm without the stagnation assumption. By considering the updates of local best positions and global best solutions, a sequence of state transform matrixes is generated during the searching process. The semistability of the proposed switched linear system is studied. The conditions of the convergence in mean and convergence in probability are derived by using the recently developed results in paracontraction. Moreover, numerical examples are provided to verify the results proposed in this paper.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据