The Langevin Monte Carlo algorithm in the non-smooth log-concave case

01/26/2021

∙

by   Joseph Lehec, et al.

∙

0

∙

share

We prove non-asymptotic polynomial bounds on the convergence of the Langevin Monte Carlo algorithmin the case where the potential is a convex function which is globally Lipschitz on its domain, typically the maximum of a finite number of affine functions onan arbitrary convex set. In particular the potential is not assumed to be gradient Lipschitz,in contrast with most (if not all) existing works on the topic.