A discrete consensus-based global optimization method with noisy objective function
From MaRDI portal
Cites work
- A consensus-based global optimization method for high dimensional machine learning problems
- A consensus-based model for global optimization and its mean-field limit
- An adaptive consensus based method for multi-objective optimization with uniform Pareto front approximation
- An analytical framework for consensus-based global optimization method
- An informational approach to the global optimization of expensive-to-evaluate functions
- Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.
- Consensus-based optimization methods converge globally
- Consensus-based optimization on hypersurfaces: Well-posedness and mean-field limit
- Constrained Consensus-Based Optimization
- Convergence analysis of the discrete consensus-based optimization algorithm with random batch interactions and heterogeneous noises
- Convergence and error estimates for time-discrete consensus-based optimization algorithms
- Fully stochastic trust-region sequential quadratic programming for equality-constrained optimization problems
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global optimization. Theory, algorithms, and applications
- scientific article; zbMATH DE number 7626752 (Why is no real title available?)
- Introduction to global optimization.
- Optimization methods for large-scale machine learning
- Recent approaches to global optimization problems through particle Swarm optimization
- Safe global optimization of expensive noisy black-box functions in the -Lipschitz framework
- Stochastic global optimization.
Cited in
(2)
This page was built for publication: A discrete consensus-based global optimization method with noisy objective function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6971086)
