PSO算法全局收敛性分析  

Analysis of Particle Swarm Optimization algorithm global convergence method

作　　者：张慧斌[1] 王鸿斌[1] 胡志军[1] 

机构地区：[1]忻州师范学院计算机科学与技术系,山西忻州034000

出　　处：《计算机工程与应用》2011年第34期61-63,共3页Computer Engineering and Applications

基　　金：山西省自然科学基金(No.2009011018-4)~~

摘　　要：为了解决PSO算法能否搜索到全局最优解这类主要理论问题,对随机优化算法的全局收敛性准则作了详细解释,并应用此全局收敛性准则对PSO算法的全局收敛性进行了理论分析;指出了PSO算法并不满足随机优化算法的全局收敛性准则应具备的两个条件,并证明了PSO算法是不能保证全局收敛的。In order to find out whether the PSO algorithm can search for global optimal solution,detailed explanation to global convergence criteria of random optimal algorithm is made.The theoretical analysis of global convergence of PSO algorithm is also done applying this global convergence criteria.The result of the PSO algorithm does not satisfy two conditions which the global convergence criteria of random optimization algorithm should have.This paper proves that the PSO algorithm does not guarantee global convergence.

关 键 词：PSO算法 随机优化算法 全局收敛性 全局最优解 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]