This article details a novel numerical scheme to approximate gradient flows for optimal transport metrics. These flows have proved useful to tackle theoretically and numerically(load induced by the resolution of each step　Indeed this corresponds to the resolution of a convex optimization problem involving a Wasserstein distance to the previous iterate　Following several recent works on the approximation of Wasserstein distances)