Convergence analysis of particle swarm optimization using stochastic Lyapunov functions and quantifier elimination

02/05/2020
by   Maximilian Gerwien, et al.
0

This paper adds to the discussion about theoretical aspects of particle swarm stability by proposing to employ stochastic Lyapunov functions and to determine the convergence set by quantifier elimination. We present a computational procedure and show that this approach leads to reevaluation and extension of previously know stability regions for PSO using a Lyapunov approach under stagnation assumptions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/16/2012

A Bayesian Interpretation of the Particle Swarm Optimization and Its Kernel Extension

Particle swarm optimization is a popular method for solving difficult op...
research
04/01/2020

Particle Swarm Optimization: Stability Analysis using N-Informers under Arbitrary Coefficient Distributions

This paper derives, under minimal modelling assumptions, a simple to use...
research
05/24/2005

A dissipative particle swarm optimization

A dissipative particle swarm optimization is developed according to the ...
research
06/06/2020

The Convergence Indicator: Improved and completely characterized parameter bounds for actual convergence of Particle Swarm Optimization

Particle Swarm Optimization (PSO) is a meta-heuristic for continuous bla...
research
05/27/2011

Finite First Hitting Time versus Stochastic Convergence in Particle Swarm Optimisation

We reconsider stochastic convergence analyses of particle swarm optimisa...
research
07/23/2022

Initial Orbit Determination for the CR3BP using Particle Swarm Optimization

This work utilizes a particle swarm optimizer (PSO) for initial orbit de...
research
06/25/2017

Well-supported phylogenies using largest subsets of core-genes by discrete particle swarm optimization

The number of complete chloroplastic genomes increases day after day, ma...

Please sign up or login with your details

Forgot password? Click here to reset