3 papers
math.OC2026
Exploiting Structure with Anisotropic Consensus-Based Optimization
Sabrina Bonandin, Konstantin Riedl, Sara Veneruso
Anisotropic consensus-based optimization (CBO), a multi-agent metaheuristic derivative-free optimization method, which reliably finds global minima of nonsmooth and nonconvex objec…
math.OC2025
Strong Global Convergence of the Consensus-Based Optimization Algorithm
Sabrina Bonandin, Konstantin Riedl, Sara Veneruso
Consensus-based optimization (CBO) is a multi-agent metaheuristic derivative-free optimization algorithm that has proven to be capable of globally minimizing nonconvex nonsmooth fu…
math.OC2025
Kinetic variable-sample methods for stochastic optimization problems
Sabrina Bonandin, Michael Herty
We discuss kinetic-based particle optimization methods and variable-sample strategies for problems where the cost function represents the expected value of a random mapping. Kineti…