Convergence analysis of particle swarm optimization in one dimension
DOI10.1016/j.aml.2022.108481OpenAlexW4307062499MaRDI QIDQ2106119
Hyeonho Ju, Dowan Koo, Young-Pil Choi
Publication date: 8 December 2022
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2022.108481
non-convex optimizationparticle swarm optimizationgradient-free optimization methodquantified optimization
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Computational methods for stochastic equations (aspects of stochastic analysis) (60H35) PDEs in connection with game theory, economics, social and behavioral sciences (35Q91) Fokker-Planck equations (35Q84)
Cites Work
- One dimensional consensus based algorithm for non-convex optimization
- A consensus-based model for global optimization and its mean-field limit
- Convergence of a first-order consensus-based global optimization algorithm
- An analytical framework for consensus-based global optimization method
- A consensus-based global optimization method for high dimensional machine learning problems
- Trends in Consensus-Based Optimization
- Zero-Inertia Limit: From Particle Swarm Optimization to Consensus-Based Optimization
- On the global convergence of particle swarm optimization methods
This page was built for publication: Convergence analysis of particle swarm optimization in one dimension