Swarm-based optimization with random descent

DOI10.1007/s10440-024-00639-0arXiv2307.12441MaRDI QIDQ6131272

Anil Zenginoglu, Eitan Tadmor

Publication date: 4 April 2024

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2307.12441

zbMATH Keywords

optimizationconvergence analysisbacktrackinggradient descentswarming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Population dynamics (general) (92D25)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A literature survey of benchmark functions for global optimisation problems
• On semi- and subanalytic geometry
• Convergence and error estimates for time-discrete consensus-based optimization algorithms
• Minimization of functions having Lipschitz continuous first partial derivatives
• A consensus-based model for global optimization and its mean-field limit
• Convergence of a first-order consensus-based global optimization algorithm
• Numerical Optimization
• An analytical framework for consensus-based global optimization method
• A consensus-based global optimization method for high dimensional machine learning problems
• On the Mathematics of Swarming: Emergent Behavior in Alignment Dynamics
• Trends in Consensus-Based Optimization
• Convergence Conditions for Ascent Methods
• A generalized Morse theory
• An Adaptive Gradient Method with Energy and Momentum

This page was built for publication: Swarm-based optimization with random descent