Analyzing Convergence and Rates of Convergence of Particle Swarm Optimization Algorithms Using Stochastic Approximation Methods

Recently, much progress has been made on particle swarm optimization (PSO). A number of works have been devoted to analyzing the convergence of the underlying algorithms. Nevertheless, in most cases, rather simplified hypotheses are used. For example, it often assumes that the swarm has only one par...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on automatic control Vol. 60; no. 7; pp. 1760 - 1773
Main Authors:	Quan Yuan, Yin, George
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.07.2015 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithm design and analysis Algorithms Approximation algorithms Approximation methods Convergence Optimization Particle swarm optimization Queuing theory rate of convergence stochastic approximation Stochastic processes weak convergence rate of convergence stochastic approximation weak convergence Particle swarm optimization (PSO)
ISSN:	0018-9286, 1558-2523
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!