In the mid 1990s two landmark metaheuristics have been proposed: Particle Swarm
Optimization and Differential Evolution. Their initial versions were very simple, but rapidly …

In this paper we provide a rigorous convergence analysis for the renowned particle swarm
optimization method by using tools from stochastic calculus and the analysis of partial …

We investigate the implementation of a new stochastic Kuramoto-Vicsek-type model for
global optimization of nonconvex functions on the sphere. This model belongs to the class of …

In this paper, we study consensus-based optimisation (CBO), a versatile, flexible and
customisable optimisation method suitable for performing nonconvex and nonsmooth global …

In this paper we study consensus-based optimization (CBO), which is a multiagent
metaheuristic derivative-free optimization method that can globally minimize nonconvex …

In this paper we study anisotropic consensus-based optimization (CBO), a population-based
metaheuristic derivative-free optimization method capable of globally minimizing nonconvex …

This paper is concerned with the large particle limit for the consensus‐based optimization
(CBO), which was postulated in the pioneering works by Carrillo, Pinnau, Totzeck and many …

In this paper, we are concerned with the global minimization of a possibly nonsmooth and
nonconvex objective function constrained on the unit hypersphere by means of a multi-agent …

For algorithms based on interacting particle systems that admit a mean-field description,
convergence analysis is often more accessible at the mean-field level. In order to transpose …

Consensus-based optimisation (CBO) is a versatile multi-particle metaheuristic optimisation
method suitable for performing non-convex and non-smooth global optimisations in high …