Consensus-based global optimization with personal best
From MaRDI portal
Publication:2047862
Abstract: In this paper we propose a variant of a consensus-based global optimization (CBO) method that uses personal best information in order to compute the global minimum of a non-convex, locally Lipschitz continuous function. The proposed approach is motivated by the original particle swarming algorithms, in which particles adjust their position with respect to the personal best, the current global best, and some additive noise. The personal best information along an individual trajectory is included with the help of a weighted mean. This weighted mean can be computed very efficiently due to its accumulative structure. It enters the dynamics via an additional drift term. We illustrate the performance with a toy example, analyze the respective memory-dependent stochastic system and compare the performance with the original CBO with component-wise noise for several benchmark problems. The proposed method has a higher success rate for computational experiments with a small particle number and where the initial particle distribution is disadvantageous with respect to the global minimum.
Recommendations
- Trends in Consensus-Based Optimization
- A consensus-based global optimization method with adaptive momentum estimation
- A consensus-based model for global optimization and its mean-field limit
- Constrained Consensus-Based Optimization
- scientific article; zbMATH DE number 970363
- An analytical framework for consensus-based global optimization method
- Convergence of a first-order consensus-based global optimization algorithm
- On globally convergent multi-objective optimization
- On convergence of "divide the best" global optimization algorithms
Cites work
- A consensus-based model for global optimization and its mean-field limit
- A literature survey of benchmark functions for global optimisation problems
- A non-linear kinetic model of self-propelled particles with multiple equilibria
- An analytical framework for consensus-based global optimization method
- Convergence and error estimates for time-discrete consensus-based optimization algorithms
- Convergence in distribution of some self-interacting diffusions
- Heterophilious dynamics enhances consensus
- scientific article; zbMATH DE number 410740 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 3445928 (Why is no real title available?)
- scientific article; zbMATH DE number 3240118 (Why is no real title available?)
- Long time behaviour and stationary regime of memory gradient diffusions
- Nonequilibrium statistical mechanics
- Optimization by simulated annealing
- Particle representations for stochastic partial differential equations with boundary conditions
- Records in stochastic processes-theory and applications
- Stochastic differential equations, backward SDEs, partial differential equations
Cited in
(30)- A constrained consensus based optimization algorithm and its application to finance
- Binary interaction methods for high dimensional global optimization and machine learning
- A short discussion is followed by an agreement on the global minimum: consensus-based global optimization
- Mean-field optimal control for biological pattern formation
- Trends in Consensus-Based Optimization
- A consensus-based global optimization method with adaptive momentum estimation
- Anisotropic diffusion in consensus-based optimization on the sphere
- From particle swarm optimization to consensus based optimization: stochastic modeling and mean-field limit
- Constrained Consensus-Based Optimization
- Optimal control problems in transport dynamics with additive noise
- On the mean‐field limit for the consensus‐based optimization
- Kinetic-based optimization enhanced by genetic dynamics
- An adaptive consensus based method for multi-objective optimization with uniform Pareto front approximation
- On the global convergence of particle swarm optimization methods
- Ensemble-Based Gradient Inference for Particle Methods in Optimization and Sampling
- Consensus-based optimization for multi-objective problems: a multi-swarm approach
- Consensus-based optimization methods converge globally
- Leveraging memory effects and gradient information in consensus-based optimisation: on global convergence in mean-field law
- Fast and robust consensus-based optimization via optimal feedback control
- Mean-field limits for consensus-based optimization and sampling
- Smoothing iterative consensus-based optimization algorithm for nonsmooth nonconvex optimization problems with global optimality
- A consensus-based algorithm for non-convex multiplayer games
- Interacting particle Langevin algorithm for maximum marginal likelihood estimation
- A PDE framework of consensus-based optimization for objectives with multiple global minimizers
- Polarized consensus-based dynamics for optimization and sampling
- Consensus-based optimisation with truncated noise
- Self-interacting CBO: existence, uniqueness, and long-time convergence
- Well-posedness and propagation of chaos for multi-agent models with strategies and diffusive effects
- Kinetic simulated annealing optimization with entropy-based cooling rate
- A particle consensus approach to solving nonconvex-nonconcave min-max problems
This page was built for publication: Consensus-based global optimization with personal best
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2047862)
