Hypocoercivity in metastable settings and kinetic simulated annealing
classification
🧮 math.PR
keywords
annealingkineticsimulatedalgorithmanalysisargumentsclassicalcombining
read the original abstract
Combining classical arguments for the analysis of the simulated annealing algorithm with the more recent hypocoercive method of distorted entropy, we prove the convergence for large time of the kinetic Langevin annealing with logarithmic cooling schedule.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.