Convergence theory for minimizing movements schemes
Flavien Léger
joint works with Pierre-Cyril Aubin-Frankowski,
Gabriele Todeschi, François-Xavier Vialard

What I will present
Theory for minimizing movement schemes in infinite dimensions and in nonsmooth (nondifferentiable) settings, with a movement limiter given by a general cost function.
Main motivation: optimization on a space of measures P(M):
minimize E:P(M)→R∪{+∞}
Typical scheme:
where D(μ,ν)=
transport cost: W22(μ,ν), Tc(μ,ν),...
Bregman divergence: KL(μ,ν),...
Csiszár divergence: ∫M(μ−ν)2,...
...
What I will present
Theory for minimizing movement schemes in infinite dimensions and in nonsmooth (nondifferentiable) settings, with a movement limiter given by a general cost function.
1. Formulations for implicit and explicit schemes in a general setting
More (not covered): forward–backward schemes, alternating minimization
2. Theory for rates of convergence based on convexity along specific paths, and generalized “L-smoothness” (“L-Lipschitz gradients”) for explicit scheme
Setting
Minimize E:X→R∪{+∞}, where X is a set (set of measures, metric space...).
Use D:X×Y→R∪{+∞}, where Y is another set (often X=Y).
Algorithm
(Implicit scheme)
Explicit minimizing movements
∃h:Y→R∪{+∞}
Definition.
E is c-concave if



c-concave
not c-concave
generalizes “L-smoothness”
Explicit minimizing movements

(majorize)
(minimize)
∃h:Y→R∪{+∞}
Definition.
E is c-concave if
Algorithm.
(Explicit scheme)
Assume E c-concave.
(L–Aubin-Frankowski '23)
Explicit minimizing movements
X,Y smooth manifolds, D∈C1(X×Y), E∈C1(X) c-concave
Under certain assumptions, the explicit scheme can be written as
More: nonsmooth mirror descent, convergence rates for Newton
2. Convergence rates
EVI and convergence rates
Definition.
(Csiszár–Tusnády ’84)
(L–Aubin-Frankowski ’23)
Evolution Variational Inequality (or five-point property):
If (xn,yn) satisfy the EVI then
sublinear rates when μ=0
exponential rates when μ>0
Theorem.
(L–Aubin-Frankowski '23)
(Ambrosio–Gigli–Savaré ’05)
Variational c-segments and NNCC spaces
⏵ s↦(x(s),yˉ) is a variational c-segment if D(x(s),yˉ) is finite and
⏵ (X×Y,D) is a space with nonnegative cross-curvature (NNCC space) if variational c-segments always exist.
X,Y two arbitrary sets, D:X×Y→R∪{±∞}.
Definition.
(L–Todeschi–Vialard '24)
More: origins in regularity of optimal transport
(Ma–Trudinger–Wang ’05)
(Trudinger–Wang ’09)
(Kim–McCann ’10)
convexity of the set of c-concave functions
(Figalli–Kim–McCann '11)
Examples
Gromov–Wasserstein
Kullback–Leibler divergence, Hellinger, Fisher–Rao costs are NNCC
Transport costs
(G×G,GW2) is NCCC
(P(X)×P(Y),Tc) NNCC ⟺ (X×Y,c) NNCC
(Polish spaces, lsc cost)
Ex: W22 on Rn, on Sn...
X=[X,f,μ] and Y=[Y,g,ν]∈G
(L–Todeschi–Vialard '24)
Variational c-segments ≈ generalized geodesics
Any Hilbert or Bregman cost is NNCC
Properties of NNCC spaces
Stable by products
Stable by quotients with “equidistant fibers”
Stable under Gromov–Hausdorff convergence
Metric cost c(x,y)=d2(x,y) NNCC⟹PC
(connect to: Ambrosio–Gigli–Savaré ’05)
(connect to: Kim–McCann '12)
(connect to: Loeper ’09)
(L–Todeschi–Vialard '24)
Convergence rates
Suppose that for each x∈X and n≥0,
Then sublinear (μ=0) or linear (μ>0) convergence rates.
⏵ there exists a variational c-segment s↦(x(s),yn) on (X×Y,D) with x(0)=xn and x(1)=x
⏵ s↦E(x(s))−μD(x(s),yn+1) is convex
⏵ s→0+limsD(x(s),yn+1)=0
Theorem.
(L–Aubin-Frankowski '23)
Thank you!
(Les Houches 2025-01-17)
By Flavien Léger
(Les Houches 2025-01-17)
- 94