Convergence of Simulated Annealing Using Kinetic Langevin Dynamics

From MaRDI portal
Publication:6401917



Abstract: We study the simulated annealing algorithm based on the kinetic Langevin dynamics, in order to find the global minimum of a non-convex potential function. For both the continuous time formulation and a discrete time analogue, we obtain the convergence rate results under technical conditions on the potential function, together with an appropriate choice of the cooling schedule and the time discretization parameters.














This page was built for publication: Convergence of Simulated Annealing Using Kinetic Langevin Dynamics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6401917)