Particle swarm optimization almost surely finds local optima

DOI10.1016/J.TCS.2014.05.017MaRDI QIDQ477085zbMATH OpenOpenAlexFDO

Authors Manuel Schmitt, Rolf Wanka

Publication date 2 December 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2014.05.017

zbMATH Keywords

particle swarm optimizationfitness landscapesquality of solution

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Stability bounds and almost sure convergence of improved particle swarm optimization methods
• scientific article; zbMATH DE number 6019552
• A Convergence Proof for the Particle Swarm Optimiser
• On convergence analysis of particle swarm optimization algorithm
• The mathematical basis of the particle swarm optimization algorithm

Cites work

• scientific article; zbMATH DE number 6019552 (Why is no real title available?)
• Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
• Analysis of particle interaction in particle swarm optimization
• Application of a particle swarm optimization algorithm for determining optimum well location and type
• Handbook of swarm intelligence. Concepts, principles and applications
• Particle swarm optimization almost surely finds local optima
• Probability. Theory and examples.
• Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm
• The particle swarm optimization algorithm: Convergence analysis and parameter selection
• Why standard particle swarm optimisers elude a theoretical runtime analysis

Cited in

(10)

• Particle swarm optimization based on local attractors of ordinary differential equation system
• Zero-inertia limit: from particle swarm optimization to consensus-based optimization
• Runtime analysis of discrete particle swarm optimization applied to shortest paths computation
• A note on the mean-field limit for the particle swarm optimization
• Stability bounds and almost sure convergence of improved particle swarm optimization methods
• Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax
• On the global convergence of particle swarm optimization methods
• Particle swarm optimization almost surely finds local optima
• Analytic solution of the continuous particle swarm optimization problem
• A finite-time particle swarm optimization algorithm for odor source localization

This page was built for publication: Particle swarm optimization almost surely finds local optima

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477085)