Reprint of: On convergence analysis of particle swarm optimization algorithm
From MaRDI portal
Publication:1636822
DOI10.1016/J.CAM.2018.04.036zbMath1432.90164OpenAlexW2799362343WikidataQ129928961 ScholiaQ129928961MaRDI QIDQ1636822
Publication date: 12 June 2018
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2018.04.036
Related Items (3)
Simultaneous estimation of tracer kinetic model parameters using analytical and inverse approaches with a hybrid method ⋮ Parameter estimation of Wiener systems based on the particle swarm iteration and gradient search principle ⋮ A novel simple particle swarm optimization algorithm for global optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Example-based learning particle swarm optimization for continuous optimization
- Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm
- Runtime analysis of a binary particle swarm optimizer
- Locating multiple optima using particle swarm optimization
- A new approach to estimating the expected first hitting time of evolutionary algorithms
- A review of particle swarm optimization. I: Background and development
- A study of particle swarm optimization particle trajectories
- Moment convergence rates in the law of logarithm for moving average process under dependence
- Analyzing Convergence and Rates of Convergence of Particle Swarm Optimization Algorithms Using Stochastic Approximation Methods
- A Convergence Proof for the Particle Swarm Optimiser
- Minimization by Random Search Techniques
- Analysis of Standard Particle Swarm Optimization Algorithm Based on Markov Chain
This page was built for publication: Reprint of: On convergence analysis of particle swarm optimization algorithm
