Convergence analysis of standard particle swarm optimization algorithm and its improvement
From MaRDI portal
Publication:1800242
DOI10.1007/S00500-017-2615-6zbMath1398.90213OpenAlexW2615488754MaRDI QIDQ1800242
Publication date: 23 October 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-017-2615-6
global optimizationanalysis of algorithmconvergence in probabilitystandard particle swarm optimization
Analysis of algorithms (68W40) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Stochastic stability analysis of composite dynamic system for particle swarm optimization ⋮ Probabilistic convergence analysis of the stochastic particle swarm optimization model without the stagnation assumption
Cites Work
- Unnamed Item
- Enhanced comprehensive learning particle swarm optimization
- Chaos-enhanced accelerated particle swarm optimization
- Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm
- Time-varying PSO - convergence analysis, convergence-related parameterization and new parameter adjustment schemes
- The particle swarm optimization algorithm: Convergence analysis and parameter selection
- An investigation into the performance of particle swarm optimization with various chaotic maps
- Improved particle swarm algorithms for global optimization
- A study of particle swarm optimization particle trajectories
This page was built for publication: Convergence analysis of standard particle swarm optimization algorithm and its improvement