Stability bounds and almost sure convergence of improved particle swarm optimization methods

DOI10.1007/s40687-020-00241-4zbMath1469.90145OpenAlexW3157129426MaRDI QIDQ2028697

Tze Leung Lai, Weng Kee Wong, Kwok Pui Choi, Xin Thomson Tong

Publication date: 1 June 2021

Published in: Research in the Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40687-020-00241-4

zbMATH Keywords

convergence to the global optimum, metaheuristic algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• GitHub
• Boids

Cites Work

• GitHub
• Nonlinear stability of the ensemble Kalman filter with adaptive covariance inflation
• Ergodicity of truncated stochastic Navier Stokes with deterministic forcing and dispersion
• Recent trends indicate rapid growth of nature-inspired optimization in academia and industry
• Markov chains and stochastic stability
• Asymptotic coupling and a general form of Harris' theorem with applications to stochastic delay equations
• The particle swarm optimization algorithm: Convergence analysis and parameter selection
• Ergodicity of the 2D Navier-Stokes equations with degenerate stochastic forcing
• Nonlinear stability and ergodicity of ensemble based Kalman filters
• Geometric Ergodicity for Piecewise Contracting Processes with Applications for Tropical Stochastic Lattice Models
• Analyzing Convergence and Rates of Convergence of Particle Swarm Optimization Algorithms Using Stochastic Approximation Methods
• Understanding Machine Learning
• Stochastic Estimation of the Maximum of a Regression Function
• A Stochastic Approximation Method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stability bounds and almost sure convergence of improved particle swarm optimization methods