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

DOI10.1109/TAC.2014.2381454zbMath1360.90312arXiv1308.5369OpenAlexW3099874119MaRDI QIDQ2982661

Quan Yuan, George Yin

Publication date: 16 May 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.5369

Mathematics Subject Classification ID

Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

Reprint of: On convergence analysis of particle swarm optimization algorithm ⋮ On convergence analysis of multi-objective particle swarm optimization algorithm ⋮ Analytical stability analysis of the fractional-order particle swarm optimization algorithm ⋮ On the global convergence of particle swarm optimization methods ⋮ On convergence analysis of particle swarm optimization algorithm ⋮ Stability bounds and almost sure convergence of improved particle swarm optimization methods ⋮ Stochastic approximation: from statistical origin to big-data, multidisciplinary applications ⋮ Dynamic Event-Triggered Leader-Follower Consensus Control for MultiAgent Systems

This page was built for publication: Analyzing Convergence and Rates of Convergence of Particle Swarm Optimization Algorithms Using Stochastic Approximation Methods