Hypocoercivity in metastable settings and kinetic simulated annealing

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.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…