arXiv Analytics

Sign in

arXiv:2404.10372 [math.OC]AbstractReferencesReviewsResources

Consensus-based algorithms for stochastic optimization problems

Sabrina Bonandin, Michael Herty

Published 2024-04-16Version 1

We address an optimization problem where the cost function is the expectation of a random mapping. To tackle the problem two approaches based on the approximation of the objective function by consensus-based particle optimization methods on the search space are developed. The resulting methods are mathematically analyzed using a mean-field approximation and their connection is established. Several numerical experiments show the validity of the proposed algorithms and investigate their rates of convergence.

Related articles: Most relevant | Search more
arXiv:2311.04161 [math.OC] (Published 2023-11-07)
Breaking the Heavy-Tailed Noise Barrier in Stochastic Optimization Problems
arXiv:2205.06725 [math.OC] (Published 2022-05-13)
Multi-Marginal Gromov-Wasserstein Transport and Barycenters
arXiv:1701.03961 [math.OC] (Published 2017-01-14)
Communication-Efficient Algorithms for Decentralized and Stochastic Optimization