Swarm gradient dynamics for global optimization: the mean-field limit case - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Article Dans Une Revue Mathematical Programming Année : 2024

Swarm gradient dynamics for global optimization: the mean-field limit case

Jérôme Bolte
  • Fonction : Auteur
  • PersonId : 960467
Laurent Miclo

Résumé

Using jointly geometric and stochastic reformulations of nonconvex problems and exploiting a Monge–Kantorovich (or Wasserstein) gradient system formulation with vanishing forces, we formally extend the simulated annealing method to a wide range of global optimization methods. Due to the built-in combination of a gradient-like strategy and particle interactions, we call them swarm gradient dynamics. As in the original paper by Holley–Kusuoka–Stroock, a functional inequality is the key to the existence of a schedule that ensures convergence to a global minimizer. One of our central theoretical contributions is proving such an inequality for one-dimensional compact manifolds. We conjecture that the inequality holds true in a much broader setting. Additionally, we describe a general method for global optimization that highlights the essential role of functional inequalities la Łojasiewicz.
Fichier principal
Vignette du fichier
wp_tse_1302.pdf (614.34 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04552722 , version 1 (19-04-2024)

Identifiants

Citer

Jérôme Bolte, Laurent Miclo, Stéphane Villeneuve. Swarm gradient dynamics for global optimization: the mean-field limit case. Mathematical Programming, 2024, 205, pp.661-701. ⟨10.1007/s10107-023-01988-8⟩. ⟨hal-04552722⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More