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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on automatic control Ročník 60; číslo 7; s. 1760 - 1773
Hlavní autoři:	Quan Yuan, Yin, George
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.07.2015 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!