Swarm-based optimization with random descent

DOI10.1007/S10440-024-00639-0arXiv2307.12441MaRDI QIDQ6131272FDOQ6131272

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 analysisbacktrackingswarminggradient descent

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Swarm-based gradient descent meets simulated annealing
• Swarm-based gradient descent method for non-convex optimization

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)