Consensus-based algorithms for stochastic optimization problems

Abstract

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.

References in corpus (7)

• A consensus-based model for global optimization and its mean-field limit
• On the Random Batch Method for second order interacting particle systems
• Propagation of chaos: a review of models, methods and applications. II. Applications
• On the mean-field limit for the consensus-based optimization
• Consensus-Based Optimization Methods Converge Globally
• Mean-field limits for Consensus-Based Optimization and Sampling
• Kinetic description and convergence analysis of genetic algorithms for global optimization