paper-with-me

홈 › Papers

From particle swarm optimization to consensus based optimization: stochastic modeling and mean-field limit

2020-12-10 · Sara Grassi, Lorenzo Pareschi

In this paper we consider a continuous description based on stochastic differential equations of the popular particle swarm optimization (PSO) process for solving global optimization problems and derive in the large particle limit the corresponding mean-field approximation based on Vlasov-Fokker-Planck-type equations. The disadvantage of memory effects induced by the need to store the local best position is overcome by the introduction of an additional differential equation describing the evolution of the local best. A regularization process for the global best permits to formally derive the respective mean-field description. Subsequently, in the small inertia limit, we compute the related macroscopic hydrodynamic equations that clarify the link with the recently introduced consensus based optimization (CBO) methods. Several numerical examples illustrate the mean field process, the small inertia limit and the potential of this general class of global optimization methods.

📄 PDF Abstract BibTeX arXiv:2012.05613

Code (0)

등록된 구현이 없습니다.

Tasks

global-optimizationPosition

Similar Papers 제목 키워드 기반

Consensus-Based Optimization on Hypersurfaces: Well-Posedness and Mean-Field Limit

2020-01-31 · Massimo Fornasier, Hui Huang, Lorenzo Pareschi, Philippe Sünnen

We introduce a new stochastic differential model for global optimization of nonconvex functions on compact hypersurfaces. The model is inspired by the stochastic Kuramoto-Vicsek system and belongs to the class of Consens…

global-optimization

Using Particle Swarm Optimization as Pathfinding Strategy in a Space with Obstacles

2021-12-16 · David, Budi Adiperdana

Particle swarm optimization (PSO) is a search algorithm based on stochastic and population-based adaptive optimization. In this paper, a pathfinding strategy is proposed to improve the efficiency of path planning for a b…

Disjoint principal component analysis by constrained binary particle swarm optimization

2020-04-22 · John Ramírez-Figueroa, Carlos Martín-Barreiro, Ana B. Nieto-Librero, Victor Leiva-Sánchez 외

In this paper, we propose an alternative method to the disjoint principal component analysis. The method consists of a principal component analysis with constraints, which allows us to determine disjoint components that …

Stochastic Optimization

Localization in Wireless Sensor Networks using Particle Swarm Optimization

2008-02-01 · Gopakumar.A​ ​, Lillykutty Jacob​

This paper proposes a novel and computationally efficient global optimization method based on swarm intelligence for locating nodes in a WSN environment. The mean squared range errors of all neighbouring anchor nodes …

global-optimization

Convergence analysis of particle swarm optimization using stochastic Lyapunov functions and quantifier elimination

2020-02-05 · Maximilian Gerwien, Rick Voßwinkel, Hendrik Richter

This paper adds to the discussion about theoretical aspects of particle swarm stability by proposing to employ stochastic Lyapunov functions and to determine the convergence set by quantifier elimination. We present a co…