Swarm-based optimization with random descent
From MaRDI portal
Publication:6131272
Recommendations
- Swarm-based gradient descent method for non-convex optimization
- Swarm-based gradient descent meets simulated annealing
- Swarm gradient dynamics for global optimization: the mean-field limit case
- Swarming for faster convergence in stochastic optimization
- A reduced-space line-search method for unconstrained optimization via random descent directions
Cites work
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A consensus-based global optimization method for high dimensional machine learning problems
- A consensus-based model for global optimization and its mean-field limit
- A generalized Morse theory
- A literature survey of benchmark functions for global optimisation problems
- An adaptive gradient method with energy and momentum
- An analytical framework for consensus-based global optimization method
- Convergence Conditions for Ascent Methods
- Convergence and error estimates for time-discrete consensus-based optimization algorithms
- Convergence of a first-order consensus-based global optimization algorithm
- Minimization of functions having Lipschitz continuous first partial derivatives
- Numerical Optimization
- On semi- and subanalytic geometry
- On the mathematics of swarming: emergent behavior in alignment dynamics
- Optimization by simulated annealing
- Trends in Consensus-Based Optimization
Cited in
(3)
This page was built for publication: Swarm-based optimization with random descent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131272)
