Convex discretization of functionals involving the Monge-Ampère operator
|
|
- Mavis Darleen Sherman
- 5 years ago
- Views:
Transcription
1 Convex discretization of functionals involving the Monge-Ampère operator Quentin Mérigot CNRS / Université Paris-Dauphine Joint work with J.D. Benamou, G. Carlier and É. Oudet Workshop on Optimal Transport in the Applied Sciences December 8-12, 2014 RICAM, Linz 1
2 2 1. Motivation: Gradient flows in Wasserstein space
3 Background: Optimal transport P 2 (R d ) = {µ P(R d ); x 2 d µ(x) < + } P ac 2 (R d ) = P 2 (R d ) L 1 (R d ) ν R d p 2 π Wasserstein distance between µ, ν P 2 (R d ), Γ(µ, ν) := {π P(R d R d ); p 1# π = µ, p 2# π = ν} Definition: W 2 2(µ, ν) := min π Γ(µ,ν) x y 2 d π(x, y). µ p 1 R d 3
4 Background: Optimal transport P 2 (R d ) = {µ P(R d ); x 2 d µ(x) < + } P ac 2 (R d ) = P 2 (R d ) L 1 (R d ) ν R d p 2 π Wasserstein distance between µ, ν P 2 (R d ), Γ(µ, ν) := {π P(R d R d ); p 1# π = µ, p 2# π = ν} Definition: W 2 2(µ, ν) := min π Γ(µ,ν) x y 2 d π(x, y). µ p 1 R d Relation to convex functions: Def: K := finite convex functions on R d 3
5 Background: Optimal transport P 2 (R d ) = {µ P(R d ); x 2 d µ(x) < + } P ac 2 (R d ) = P 2 (R d ) L 1 (R d ) ν R d p 2 π Wasserstein distance between µ, ν P 2 (R d ), Γ(µ, ν) := {π P(R d R d ); p 1# π = µ, p 2# π = ν} Definition: W 2 2(µ, ν) := min π Γ(µ,ν) x y 2 d π(x, y). µ p 1 R d Relation to convex functions: Def: K := finite convex functions on R d Theorem (Brenier): Given µ P2 ac (R d ) the map φ K φ # µ P 2 (R d ) is surjective and moreover, W 2 2(µ, φ # µ) = x φ(x) 2 d µ(x) R d [Brenier 91] 3
6 Background: Optimal transport P 2 (R d ) = {µ P(R d ); x 2 d µ(x) < + } P ac 2 (R d ) = P 2 (R d ) L 1 (R d ) ν R d p 2 π Wasserstein distance between µ, ν P 2 (R d ), Γ(µ, ν) := {π P(R d R d ); p 1# π = µ, p 2# π = ν} Definition: W 2 2(µ, ν) := min π Γ(µ,ν) x y 2 d π(x, y). µ p 1 R d Relation to convex functions: Def: K := finite convex functions on R d Theorem (Brenier): Given µ P2 ac (R d ) the map φ K φ # µ P 2 (R d ) is surjective and moreover, W 2 2(µ, φ # µ) = x φ(x) 2 d µ(x) R d [Brenier 91] Given any µ P ac 2 (R d ), we get a parameterization of P 2 (R d ), as seen from µ. 3
7 Motivation 1: Crowd Motion Under Congestion JKO scheme for crowd motion with hard congestion: [Maury-Roudneff-Chupin-Santambrogio 10] ρ τ k+1 = min σ P 2 (X) 1 2τ W2 2(ρ τ k, σ) + E(σ) + U(σ) ( ) where X R d is convex and bounded, and U(ν) := { 0 if d ν = f d H d, f 1 E(ν) := V (x) d ν(x) R d + if not congestion potential energy 4
8 Motivation 1: Crowd Motion Under Congestion JKO scheme for crowd motion with hard congestion: [Maury-Roudneff-Chupin-Santambrogio 10] ρ τ k+1 = min σ P 2 (X) 1 2τ W2 2(ρ τ k, σ) + E(σ) + U(σ) ( ) where X R d is convex and bounded, and U(ν) := { 0 if d ν = f d H d, f 1 E(ν) := V (x) d ν(x) R d + if not congestion potential energy Assuming σ = φ # ρ τ k with φ convex, the Wasserstein term becomes explicit: ( ) min φ 1 2τ R d x φ(x) 2 ρ τ k (x) d x + E( φ #ρ τ k ) + U( φ #ρ τ k ) On the other hand, the constraint becomes strongly nonlinear: U( φ # ρ τ k ) < + det D2 φ(x) ρ k (x) 4
9 Motivation 2: Nonlinear Diffusion ( ) ρ t = div [ρ (U (ρ) + V + W ρ)] ρ(0,.) = ρ 0 ρ(t,.) P ac (R d ) 5
10 Motivation 2: Nonlinear Diffusion ( ) ρ t = div [ρ (U (ρ) + V + W ρ)] ρ(0,.) = ρ 0 ρ(t,.) P ac (R d ) Formally, ( ) can be seen as the W 2 -gradient flow of U + E, with U(ν) := U(f(x)) d x if d ν = f d H d R d + if not internal energy, ex: U(r) = r log r = entropy E(ν) := R d V (x) d ν(x) + R d W (x y) d[ν ν](x, y) potential energy interaction energy 5
11 Motivation 2: Nonlinear Diffusion ( ) ρ t = div [ρ (U (ρ) + V + W ρ)] ρ(0,.) = ρ 0 ρ(t,.) P ac (R d ) Formally, ( ) can be seen as the W 2 -gradient flow of U + E, with U(ν) := U(f(x)) d x if d ν = f d H d R d + if not internal energy, ex: U(r) = r log r = entropy E(ν) := R d V (x) d ν(x) + R d W (x y) d[ν ν](x, y) potential energy interaction energy JKO time discrete scheme: for τ > 0, [Jordan-Kinderlehrer-Otto 98] ρ τ k+1 = arg min σ P(R d ) 1 2τ W 2(ρ τ k, σ)2 + U(σ) + E(σ) 5
12 Motivation 2: Nonlinear Diffusion ( ) ρ t = div [ρ (U (ρ) + V + W ρ)] ρ(0,.) = ρ 0 ρ(t,.) P ac (R d ) Formally, ( ) can be seen as the W 2 -gradient flow of U + E, with U(ν) := U(f(x)) d x if d ν = f d H d R d + if not internal energy, ex: U(r) = r log r = entropy E(ν) := R d V (x) d ν(x) + R d W (x y) d[ν ν](x, y) potential energy interaction energy JKO time discrete scheme: for τ > 0, [Jordan-Kinderlehrer-Otto 98] ρ τ k+1 = arg min σ P(R d ) 1 2τ W 2(ρ τ k, σ)2 + U(σ) + E(σ) 5 Many applications: porous medium equation, cell movement via chemotaxis, Cournot-Nash equilibra, etc.
13 Displacement Convex Setting For X convex bounded and µ P ac (X), min ν P(X) 1 2τ W2 2(µ, ν) + E(ν) + U(ν) spt(ν) X 6
14 Displacement Convex Setting For X convex bounded and µ P ac (X), K X := {φ convex ; φ X} min ν P(X) 1 2τ W2 2(µ, ν) + E(ν) + U(ν) min φ KX 1 2τ W2 2(µ, φ # µ) + U( φ # µ) + E( φ # µ) ( X ) 6
15 Displacement Convex Setting For X convex bounded and µ P ac (X), K X := {φ convex ; φ X} min ν P(X) 1 2τ W2 2(µ, ν) + E(ν) + U(ν) min φ KX 1 2τ W2 2(µ, φ # µ) + U( φ # µ) + E( φ # µ) ( X ) When is the minimization problem ( X ) convex? U(ν) := R d U ( d ν d H d ) d x E(ν) := R d (V + W ν) d ν 6
16 Displacement Convex Setting For X convex bounded and µ P ac (X), K X := {φ convex ; φ X} min ν P(X) 1 2τ W2 2(µ, ν) + E(ν) + U(ν) min φ KX 1 2τ W2 2(µ, φ # µ) + U( φ # µ) + E( φ # µ) ( X ) When is the minimization problem ( X ) convex? U(ν) := R d U ( d ν d H d ) d x E(ν) := R d (V + W ν) d ν Theorem: ( X ) is convex if (H1) V, W : R d R are convex functions, NB: U( φ # ρ) = U (H2) r d U(r d ) is convex non-increasing, U(0) = 0. ( ) ρ(x) MA[φ](x) MA[φ](x) d x [McCann 94] MA[φ](x) := det(d 2 φ(x)) 6
17 Displacement Convex Setting For X convex bounded and µ P ac (X), K X := {φ convex ; φ X} min ν P(X) 1 2τ W2 2(µ, ν) + E(ν) + U(ν) min φ KX 1 2τ W2 2(µ, φ # µ) + U( φ # µ) + E( φ # µ) ( X ) When is the minimization problem ( X ) convex? U(ν) := R d U ( d ν d H d ) d x E(ν) := R d (V + W ν) d ν Theorem: ( X ) is convex if (H1) V, W : R d R are convex functions, NB: U( φ # ρ) = U (H2) r d U(r d ) is convex non-increasing, U(0) = 0. ( ) ρ(x) MA[φ](x) MA[φ](x) d x [McCann 94] MA[φ](x) := det(d 2 φ(x)) Goal: convergent and convex spatial discretization of ( X ) & numerical applications. 6
18 Numerical applications of the JKO scheme Numerical applications of the (variational) JKO scheme are still limited: 7
19 Numerical applications of the JKO scheme Numerical applications of the (variational) JKO scheme are still limited: 1D: monotone rearrangement e.g. [Kinderleherer-Walkington 99] [Blanchet-Calvez-Carrillo 08] [Agueh-Bowles 09] 7
20 Numerical applications of the JKO scheme Numerical applications of the (variational) JKO scheme are still limited: 1D: monotone rearrangement e.g. [Kinderleherer-Walkington 99] [Blanchet-Calvez-Carrillo 08] [Agueh-Bowles 09] 2D: optimal transport plans diffeomorphisms [Carrillo-Moll 09] U = hard congestion term [Maury-Roudneff-Chupin-Santambrogio 10] 7
21 Numerical applications of the JKO scheme Numerical applications of the (variational) JKO scheme are still limited: 1D: monotone rearrangement e.g. [Kinderleherer-Walkington 99] [Blanchet-Calvez-Carrillo 08] [Agueh-Bowles 09] 2D: optimal transport plans diffeomorphisms [Carrillo-Moll 09] U = hard congestion term [Maury-Roudneff-Chupin-Santambrogio 10] Our goal is to approximate a JKO step numerically, in dimension 2: For X convex bounded and µ P ac (X), ( X ) min ν P(X) 1 2τ W2 2(µ, ν) + E(ν) + U(ν) 7
22 Numerical applications of the JKO scheme Numerical applications of the (variational) JKO scheme are still limited: 1D: monotone rearrangement e.g. [Kinderleherer-Walkington 99] [Blanchet-Calvez-Carrillo 08] [Agueh-Bowles 09] 2D: optimal transport plans diffeomorphisms [Carrillo-Moll 09] U = hard congestion term [Maury-Roudneff-Chupin-Santambrogio 10] Our goal is to approximate a JKO step numerically, in dimension 2: For X convex bounded and µ P ac (X), ( X ) min ν P(X) 1 2τ W2 2(µ, ν) + E(ν) + U(ν) Plan of the talk: Part 2: Convex discretization of the problem ( X ) under McCann s hypotheses. Part 3: Γ-convergence results from the discrete problem to the continuous one. Part 4: Numerical simulations: non-linear diffusion, crowd motion. 7
23 8 2. Convex discretization of a JKO step
24 Prior work: Discretizing the Space of Convex Functions min φ K X F (φ(x), φ(x)) d µ(x) K := {φ convex} Finite elements: piecewise-linear convex functions over a fixed mesh number of constraints is N := card(p ) P X 9
25 Prior work: Discretizing the Space of Convex Functions min φ K X F (φ(x), φ(x)) d µ(x) K := {φ convex} Finite elements: piecewise-linear convex functions over a fixed mesh number of constraints is N := card(p ) non-convergence result P X [Choné-Le Meur 99] 9
26 Prior work: Discretizing the Space of Convex Functions min φ K X F (φ(x), φ(x)) d µ(x) K := {φ convex} P X Finite differences, using convex interpolates Finite elements: piecewise-linear convex functions over a fixed mesh number of constraints is N := card(p ) non-convergence result [Choné-Le Meur 99] [Carlier-Lachand-Robert-Maury 01] convergent, but number of constraints is N 2 [Ekeland Moreno-Bromberg 10] 9
27 Prior work: Discretizing the Space of Convex Functions min φ K X F (φ(x), φ(x)) d µ(x) K := {φ convex} P X Finite differences, using convex interpolates Finite elements: piecewise-linear convex functions over a fixed mesh number of constraints is N := card(p ) [Choné-Le Meur 99] convergent, but number of constraints is N 2 [Ekeland Moreno-Bromberg 10] adaptive method exterior parameterization non-convergence result [Carlier-Lachand-Robert-Maury 01] [Mirebeau 14] [Oberman 14] [Oudet-M. 14] 9
28 Prior work: Discretizing the Space of Convex Functions min φ K X F (φ(x), φ(x)) d µ(x) K := {φ convex} P X Finite differences, using convex interpolates Finite elements: piecewise-linear convex functions over a fixed mesh number of constraints is N := card(p ) [Choné-Le Meur 99] convergent, but number of constraints is N 2 [Ekeland Moreno-Bromberg 10] adaptive method exterior parameterization non-convergence result [Carlier-Lachand-Robert-Maury 01] [Mirebeau 14] [Oberman 14] [Oudet-M. 14] 9 Our functional involves the Monge-Ampère operator det D 2 φ: this will help us.
29 Discretizing the Space of Convex Functions min φ KX 1 2τ W2 2(µ, φ # µ) + E( φ # µ) + U( φ # µ) K X := {φ cvx ; φ X} Definition: Given P X finite, K X (P ) = {ψ P ; ψ K X } = φ : P R P X 10
30 Discretizing the Space of Convex Functions min φ KX 1 2τ W2 2(µ, φ # µ) + E( φ # µ) + U( φ # µ) K X := {φ cvx ; φ X} Definition: Given P X finite, K X (P ) = {ψ P ; ψ K X } finite-dimensional convex set = φ : P R P X 10
31 Discretizing the Space of Convex Functions min φ KX 1 2τ W2 2(µ, φ # µ) + E( φ # µ) + U( φ # µ) K X := {φ cvx ; φ X} Definition: Given P X finite, K X (P ) = {ψ P ; ψ K X } finite-dimensional convex set extension of φ K X (P ): ˆφ = φ : P R X = [ 1, 1] φ : P R ˆφ : R d R K X ˆφ := max{ψ; ψ K X and ψ P φ} K X P X 10
32 Discretizing the Space of Convex Functions min φ KX 1 2τ W2 2(µ, φ # µ) + E( φ # µ) + U( φ # µ) K X := {φ cvx ; φ X} Definition: Given P X finite, K X (P ) = {ψ P ; ψ K X } finite-dimensional convex set extension of φ K X (P ): ˆφ = φ : P R X = [ 1, 1] φ : P R ˆφ : R d R K X ˆφ := max{ψ; ψ K X and ψ P φ} K X P X Discrete push-forward of µ P = p P µ pδ p P(P ) 10
33 Discretizing the Space of Convex Functions min φ KX 1 2τ W2 2(µ, φ # µ) + E( φ # µ) + U( φ # µ) K X := {φ cvx ; φ X} Definition: Given P X finite, K X (P ) = {ψ P ; ψ K X } finite-dimensional convex set extension of φ K X (P ): ˆφ = φ : P R X = [ 1, 1] φ : P R ˆφ : R d R K X ˆφ := max{ψ; ψ K X and ψ P φ} K X P X Discrete push-forward of µ P = p P µ pδ p P(P ) p Definition: For φ K X (P ), let V p := ˆφ(p) and V p X 10
34 Discretizing the Space of Convex Functions min φ KX 1 2τ W2 2(µ, φ # µ) + E( φ # µ) + U( φ # µ) K X := {φ cvx ; φ X} Definition: Given P X finite, K X (P ) = {ψ P ; ψ K X } finite-dimensional convex set extension of φ K X (P ): ˆφ = φ : P R X = [ 1, 1] φ : P R ˆφ : R d R K X ˆφ := max{ψ; ψ K X and ψ P φ} K X P X Discrete push-forward of µ P = p P µ pδ p P(P ) p Definition: For φ K X (P ), let V p := ˆφ(p) and V p X Gφ # µ P := p P µ p H d (V p ) Hd Vp P ac (X) 10
35 Convex Space-Discretization of One JKO Step Theorem: Under McCann s hypothesis (H1) and (H2), the problem min φ K G X (P ) 1 2τ W2 2(µ P, Hφ # µ P ) + E(Hφ # µ P ) + U(Gφ # µ P ) is convex, and the minimum is unique if r d U(r d ) is strictly convex. [Benamou, Carlier, M., Oudet 14] 11
36 Convex Space-Discretization of One JKO Step Theorem: Under McCann s hypothesis (H1) and (H2), the problem min φ K G X (P ) 1 2τ W2 2(µ P, Hφ # µ P ) + E(Hφ # µ P ) + U(Gφ # µ P ) is convex, and the minimum is unique if r d U(r d ) is strictly convex. [Benamou, Carlier, M., Oudet 14] Unfortunately, two different definitions of push-forward seem necessary. 11
37 Convex Space-Discretization of One JKO Step Theorem: Under McCann s hypothesis (H1) and (H2), the problem min φ K G X (P ) 1 2τ W2 2(µ P, Hφ # µ P ) + E(Hφ # µ P ) + U(Gφ # µ P ) is convex, and the minimum is unique if r d U(r d ) is strictly convex. [Benamou, Carlier, M., Oudet 14] Unfortunately, two different definitions of push-forward seem necessary. The convexity of φ K X (P ) U(Gφ # µ P ) follows from the log-concavity of the discrete Monge-Ampère operator: MA[φ](p) := H d ( ˆφ(p)). 11
38 Convex Space-Discretization of One JKO Step Theorem: Under McCann s hypothesis (H1) and (H2), the problem min φ K G X (P ) 1 2τ W2 2(µ P, Hφ # µ P ) + E(Hφ # µ P ) + U(Gφ # µ P ) is convex, and the minimum is unique if r d U(r d ) is strictly convex. [Benamou, Carlier, M., Oudet 14] Unfortunately, two different definitions of push-forward seem necessary. The convexity of φ K X (P ) U(Gφ # µ P ) follows from the log-concavity of the discrete Monge-Ampère operator: MA[φ](p) := H d ( ˆφ(p)). If lim r U(r)/r = +, the internal energy is a barrier for convexity, i.e. U(Gφ # µ P ) < + = p P, MA[φ](p) = H d ( ˆφ(p)) > 0 = φ is in the interior of K X (P ). 11 NB: P non-linear constraints vs P 2 linear constraints
39 Convex Space-Discretization of the Internal Energy Proposition: Under McCann s assumption, φ K X (P ) U(Gφ # µ P ) is convex. 12
40 Convex Space-Discretization of the Internal Energy Proposition: Under McCann s assumption, φ K X (P ) U(Gφ # µ P ) is convex. Discrete Monge-Ampère operator: MA[φ](p) := H d ( ˆφ(p)). 12
41 Convex Space-Discretization of the Internal Energy Proposition: Under McCann s assumption, φ K X (P ) U(Gφ # µ P ) is convex. Discrete Monge-Ampère operator: MA[φ](p) := H d ( ˆφ(p)). Proof: Recall Gφ # µ P = p P [µ p/ma[φ](p)]1 ˆφ(p). With U(σ) = U(σ(x)) d x, U(G ac φ# µ P ) = p P U (µ p/ma[φ](p)) MA[φ](p) NB: similarity with U( φ # ρ) = U ( ) ρ(x) MA[φ](x) MA[φ](x) d x 12
42 Convex Space-Discretization of the Internal Energy Proposition: Under McCann s assumption, φ K X (P ) U(Gφ # µ P ) is convex. Discrete Monge-Ampère operator: MA[φ](p) := H d ( ˆφ(p)). Proof: Recall Gφ # µ P = p P [µ p/ma[φ](p)]1 ˆφ(p). With U(σ) = U(σ(x)) d x, U(G ac φ# µ P ) = p P U (µ p/ma[φ](p)) MA[φ](p) case U(r) = r log r = p P µ p log(ma[φ](p)) + p P µ p log(µ p ) 12
43 Convex Space-Discretization of the Internal Energy Proposition: Under McCann s assumption, φ K X (P ) U(Gφ # µ P ) is convex. Discrete Monge-Ampère operator: MA[φ](p) := H d ( ˆφ(p)). Proof: Recall Gφ # µ P = p P [µ p/ma[φ](p)]1 ˆφ(p). With U(σ) = U(σ(x)) d x, U(G ac φ# µ P ) = p P U (µ p/ma[φ](p)) MA[φ](p) case U(r) = r log r = p P µ p log(ma[φ](p)) + p P µ p log(µ p ) Lemma: Given φ 0, φ 1 K X (P ), φ t := (1 t)φ 0 + tφ 1 and ˆφ t (p) (1 t) ˆφ 0 (p) t ˆφ 1 (p). = Minkowski sum 12
44 Convex Space-Discretization of the Internal Energy Proposition: Under McCann s assumption, φ K X (P ) U(Gφ # µ P ) is convex. Discrete Monge-Ampère operator: MA[φ](p) := H d ( ˆφ(p)). Proof: Recall Gφ # µ P = p P [µ p/ma[φ](p)]1 ˆφ(p). With U(σ) = U(σ(x)) d x, U(G ac φ# µ P ) = p P U (µ p/ma[φ](p)) MA[φ](p) case U(r) = r log r = p P µ p log(ma[φ](p)) + p P µ p log(µ p ) Lemma: Given φ 0, φ 1 K X (P ), φ t := (1 t)φ 0 + tφ 1 and ˆφ t (p) (1 t) ˆφ 0 (p) t ˆφ 1 (p). = Minkowski sum = log H d ( ˆφ t ) log H d ((1 t) ˆφ 0 (p) t ˆφ 1 (p)). Brunn-Minkowski (1 t) log H d ( ˆφ 0 (p)) + t log H d ( ˆφ 1 (p))). 12
45 Convex Space-Discretization of the Internal Energy Proposition: Under McCann s assumption, φ K X (P ) U(Gφ # µ P ) is convex. Discrete Monge-Ampère operator: MA[φ](p) := H d ( ˆφ(p)). Proof: Recall Gφ # µ P = p P [µ p/ma[φ](p)]1 ˆφ(p). With U(σ) = U(σ(x)) d x, U(G ac φ# µ P ) = p P U (µ p/ma[φ](p)) MA[φ](p) case U(r) = r log r = p P µ p log(ma[φ](p)) + p P µ p log(µ p ) Lemma: Given φ 0, φ 1 K X (P ), φ t := (1 t)φ 0 + tφ 1 and ˆφ t (p) (1 t) ˆφ 0 (p) t ˆφ 1 (p). = Minkowski sum = log H d ( ˆφ t ) log H d ((1 t) ˆφ 0 (p) t ˆφ 1 (p)). Brunn-Minkowski (1 t) log H d ( ˆφ 0 (p)) + t log H d ( ˆφ 1 (p))). = U(Gφ t #µ P ) (1 t)u(gφ t #µ P ) + tu(gφ t #µ P ) 12
46 13 3. A Γ-convergence result
47 Convergence of the Space-Discretization Setting: X bounded and convex, µ P ac (X) with density c 1 ρ c min ν P(X) 1 2τ W2 2(µ, ν) + E(ν) + U(ν) ( ) 14
48 Convergence of the Space-Discretization Setting: X bounded and convex, µ P ac (X) with density c 1 ρ c min ν P(X) 1 2τ W2 2(µ, ν) + E(ν) + U(ν) ( ) (C1) E continuous, U l.s.c on (P(X), W 2 ) 14
49 Convergence of the Space-Discretization Setting: X bounded and convex, µ P ac (X) with density c 1 ρ c min ν P(X) 1 2τ W2 2(µ, ν) + E(ν) + U(ν) ( ) (C1) E continuous, U l.s.c on (P(X), W 2 ) (C2) U(ρ) = U(ρ(x)) d x, where U M is convex. 14
50 Convergence of the Space-Discretization Setting: X bounded and convex, µ P ac (X) with density c 1 ρ c min ν P(X) 1 2τ W2 2(µ, ν) + E(ν) + U(ν) ( ) (C1) E continuous, U l.s.c on (P(X), W 2 ) (C2) U(ρ) = U(ρ(x)) d x, where U M is convex. McCann s condition for displacement-convexity 14
51 Convergence of the Space-Discretization Setting: X bounded and convex, µ P ac (X) with density c 1 ρ c min ν P(X) 1 2τ W2 2(µ, ν) + E(ν) + U(ν) ( ) (C1) E continuous, U l.s.c on (P(X), W 2 ) (C2) U(ρ) = U(ρ(x)) d x, where U M is convex. McCann s condition for displacement-convexity Theorem: Let P n X finite, µ n P(P n ) with lim W 2 (µ n, µ) = 0, and: min φ K G X (P n ) 1 2τ W 2(µ n, Hφ # µ n ) + E(Hφ # µ n ) + U(Gφ # µ n ) ( ) n If φ n minimizes ( ) n, then (Gφ n #µ n ) is a minimizing sequence for ( ). [Benamou, Carlier, M., Oudet 14] 14
52 Convergence of the Space-Discretization Setting: X bounded and convex, µ P ac (X) with density c 1 ρ c min ν P(X) 1 2τ W2 2(µ, ν) + E(ν) + U(ν) ( ) (C1) E continuous, U l.s.c on (P(X), W 2 ) (C2) U(ρ) = U(ρ(x)) d x, where U M is convex. McCann s condition for displacement-convexity Theorem: Let P n X finite, µ n P(P n ) with lim W 2 (µ n, µ) = 0, and: min φ K G X (P n ) 1 2τ W 2(µ n, Hφ # µ n ) + E(Hφ # µ n ) + U(Gφ # µ n ) ( ) n If φ n minimizes ( ) n, then (Gφ n #µ n ) is a minimizing sequence for ( ). Proof relies on Caffarelli s regularity theorem. [Benamou, Carlier, M., Oudet 14] 14
53 Convergence of the Space-Discretization Setting: X bounded and convex, µ P ac (X) with density c 1 ρ c min ν P(X) 1 2τ W2 2(µ, ν) + E(ν) + U(ν) ( ) (C1) E continuous, U l.s.c on (P(X), W 2 ) (C2) U(ρ) = U(ρ(x)) d x, where U M is convex. McCann s condition for displacement-convexity Theorem: Let P n X finite, µ n P(P n ) with lim W 2 (µ n, µ) = 0, and: min φ K G X (P n ) 1 2τ W 2(µ n, Hφ # µ n ) + E(Hφ # µ n ) + U(Gφ # µ n ) ( ) n If φ n minimizes ( ) n, then (Gφ n #µ n ) is a minimizing sequence for ( ). Proof relies on Caffarelli s regularity theorem. [Benamou, Carlier, M., Oudet 14] When P n is a regular grid, there is an alternative (and quantitative) argument 14
54 Proof of the convergence theorem: Lower bound JKO step: X bounded and convex, µ P ac (X) with density c 1 ρ c Let m := min σ P(X) F(σ) m n := min φn K X (P n ) F n (Gφ n #µ n ) F(σ) := W 2 2(µ, σ) + E(σ) + U(σ) F n (σ) := W 2 2(µ n, σ) + E(σ) + U(σ) Step 1: lim inf m n m 15
55 Proof of the convergence theorem: Lower bound JKO step: X bounded and convex, µ P ac (X) with density c 1 ρ c Let m := min σ P(X) F(σ) m n := min φn K X (P n ) F n (Gφ n #µ n ) F(σ) := W 2 2(µ, σ) + E(σ) + U(σ) F n (σ) := W 2 2(µ n, σ) + E(σ) + U(σ) Step 1: lim inf m n m Step 2: lim sup m n m = min σ P(X) F(σ) 15
56 Proof of the convergence theorem: Lower bound JKO step: X bounded and convex, µ P ac (X) with density c 1 ρ c Let m := min σ P(X) F(σ) m n := min φn K X (P n ) F n (Gφ n #µ n ) F(σ) := W 2 2(µ, σ) + E(σ) + U(σ) F n (σ) := W 2 2(µ n, σ) + E(σ) + U(σ) Step 1: lim inf m n m Step 2: lim sup m n m = min σ P(X) F(σ) Using (C2) and a convolution argument = Given any probability density σ C 0 (X) with ε < σ < ε 1, φ n K X (P n ) s.t. lim n σ σ n L (X) = 0, where σ n is the density of Gφ n #µ n. 15
57 Proof of the convergence theorem: Lower bound Step 2 : Given any prob. density σ C 0 (X) s.t. ε < σ < ε 1, φ n K X (P n ) s.t. lim n σ σ n L (X) = 0, where σ n := density of Gφ n #µ n. φ µ σ = φ # µ X X 16
58 Proof of the convergence theorem: Lower bound Step 2 : Given any prob. density σ C 0 (X) s.t. ε < σ < ε 1, φ n K X (P n ) s.t. lim n σ σ n L (X) = 0, where σ n := density of Gφ n #µ n. (a) Given µ n = p P n µ p δ p, take φ n K X (P n ) O.T. potential between µ n and σ: p P n, σ(vp n ) = µ p, where Vp n := ˆφ n (p) φ µ σ = φ # µ X X p ˆφ n V n p X spt(µ n ) = P n X 16 σ n
59 Proof of the convergence theorem: Lower bound Step 2 : Given any prob. density σ C 0 (X) s.t. ε < σ < ε 1, φ n K X (P n ) s.t. lim n σ σ n L (X) = 0, where σ n := density of Gφ n #µ n. (a) Given µ n = p P n µ p δ p, take φ n K X (P n ) O.T. potential between µ n and σ: p P n, σ(vp n ) = µ p, where Vp n := ˆφ n (p) φ (b) σ n := Gφ n #µ n = p P n σ(v n p ) H d (V n p )1 V n p. µ σ = φ # µ X X p ˆφ n V n p X spt(µ n ) = P n X 16 σ n
60 Proof of the convergence theorem: Lower bound Step 2 : Given any prob. density σ C 0 (X) s.t. ε < σ < ε 1, φ n K X (P n ) s.t. lim n σ σ n L (X) = 0, where σ n := density of Gφ n #µ n. (a) Given µ n = p P n µ p δ p, take φ n K X (P n ) O.T. potential between µ n and σ: p P n, σ(vp n ) = µ p, where Vp n := ˆφ n (p) X φ µ σ = φ # µ X (b) σ n := Gφ n #µ n = p P n σ(v n p ) H d (V n p )1 V n p. (c) If max p Pn diam(vp n ) n 0 (1), then lim n σ σ n L (X) = 0. p ˆφ n V n p X spt(µ n ) = P n X 16 σ n
61 Proof of the convergence theorem: Lower bound Step 2 : Given any prob. density σ C 0 (X) s.t. ε < σ < ε 1, φ n K X (P n ) s.t. lim n σ σ n L (X) = 0, where σ n := density of Gφ n #µ n. (a) Given µ n = p P n µ p δ p, take φ n K X (P n ) O.T. potential between µ n and σ: p P n, σ(vp n ) = µ p, where Vp n := ˆφ n (p) X p φ µ σ = φ # µ ˆφ n X X V n p (b) σ n := Gφ n #µ n = p P n σ(v n p ) H d (V n p )1 V n p. (c) If max p Pn diam(vp n ) n 0 (1), then (d) Assume not (1): p n P n s.t. diam(v n p ) ε. (2) lim n σ σ n L (X) = 0. Up to extraction, ˆφ n. φ, so that diam( φ(x)) ε where x = lim n p n X. spt(µ n ) = P n X 16 σ n
62 Proof of the convergence theorem: Lower bound Step 2 : Given any prob. density σ C 0 (X) s.t. ε < σ < ε 1, φ n K X (P n ) s.t. lim n σ σ n L (X) = 0, where σ n := density of Gφ n #µ n. (a) Given µ n = p P n µ p δ p, take φ n K X (P n ) O.T. potential between µ n and σ: p P n, σ(vp n ) = µ p, where Vp n := ˆφ n (p) X p φ µ σ = φ # µ ˆφ n X V n p (b) σ n := Gφ n #µ n = p P n σ(v n p ) H d (V n p )1 V n p. (c) If max p Pn diam(vp n ) n 0 (1), then (d) Assume not (1): p n P n s.t. diam(v n p ) ε. (2) lim n σ σ n L (X) = 0. Up to extraction, ˆφ n. φ, so that diam( φ(x)) ε where x = lim n p n X. spt(µ n ) = P n X X σ n (e) Moreover, φ # ρ = σ. By Caffarelli s regularity theorem, φ C 1 : Contradiction of (2). 16
63 17 4. Numerical results
64 Computing the discrete Monge-Ampère operator U(Gφ # µ P ) = p P U (µ p/ma[φ](p)) MA[φ](p) with MA[φ](p) := H d ( ˆφ(p)). Goal: fast computation of MA[φ](p) and its 1st/2nd derivatives w.r.t φ 18
65 Computing the discrete Monge-Ampère operator U(Gφ # µ P ) = p P U (µ p/ma[φ](p)) MA[φ](p) with MA[φ](p) := H d ( ˆφ(p)). Goal: fast computation of MA[φ](p) and its 1st/2nd derivatives w.r.t φ We rely on the notion of Laguerre (or power) cell in computational geometry Lag φ P (p) X Definition: Given a function φ : P R, Lag φ P (p) := {y Rd ; q P, φ(q) φ(p) + q p y } p 18
66 Computing the discrete Monge-Ampère operator U(Gφ # µ P ) = p P U (µ p/ma[φ](p)) MA[φ](p) with MA[φ](p) := H d ( ˆφ(p)). Goal: fast computation of MA[φ](p) and its 1st/2nd derivatives w.r.t φ We rely on the notion of Laguerre (or power) cell in computational geometry Lag φ P (p) X Definition: Given a function φ : P R, Lag φ P (p) := {y Rd ; q P, φ(q) φ(p) + q p y } p 18 Lemma: For φ K X (P ) and p P, ˆφ(p) = Lag φ P (p) X.
67 Computing the discrete Monge-Ampère operator U(Gφ # µ P ) = p P U (µ p/ma[φ](p)) MA[φ](p) with MA[φ](p) := H d ( ˆφ(p)). Goal: fast computation of MA[φ](p) and its 1st/2nd derivatives w.r.t φ We rely on the notion of Laguerre (or power) cell in computational geometry Lag φ P (p) X Definition: Given a function φ : P R, Lag φ P (p) := {y Rd ; q P, φ(q) φ(p) + q p y } p For φ(p) = p 2 /2, one gets the Voronoi cell: Lag φ P (p) := {y; q P, q y 2 p y 2 } Computation in time O( P log P ) in 2D 18 Lemma: For φ K X (P ) and p P, ˆφ(p) = Lag φ P (p) X.
68 Computing the discrete Monge-Ampère operator Global construction of the intersections (Lag φ P (p) X) p P in 2D. ˆφ(p 1 ) ˆφ(p 2 ) s 3 s 2 Assumption: X = s S s, with S = finite family of segments. s 3 s 2 p 1 p 2 T s 4 s 1 s 4 s 1 Combinatorics stored as an (abstract) triangulation T of the finite set P S, i.e. 19 (p 1, p 2, p 3 ) T iff (Lag φ P (p 1) Lag φ P (p 2) Lag φ P (p 3)) X (p 1, p 2, s 1 ) T iff (Lag φ P (p 1) Lag φ P (p 2) s 1 ) X (p 1, s 1, s 2 ) T iff (Lag φ P (p 1) s 1 s 2 X) Computation in time O( P log P + S ) in 2D.
69 Computing the discrete Monge-Ampère operator Global construction of the intersections (Lag φ P (p) X) p P in 2D. ˆφ(p 1 ) ˆφ(p 2 ) s 3 s 2 Assumption: X = s S s, with S = finite family of segments. s 3 s 2 p 1 p 2 T s 4 s 1 s 4 s 1 Computation of MA(p) = H 2 (Lag φ P (p) X) and its derivatives. The sparsity structure of the Jacobian/Hessian is encoded in T : MA(p) φ(q) 2 MA(p) φ(r) φ(q) 0 = (p, q) is an edge of T 0 = (p, q, r) is a triangle of T 19
70 Example 1: Nonlinear diffusion on point clouds ( ) ρ t = ρm ρ n X on X on X fast diffusion equation: m [1 1/d, 1) porous medium equation: m > 1 Gradient flow in (P(X), W 2 ). for U(ρ) = U(ρ(x)) d x with U(r) = rm m 1 [Otto] 20
71 Example 1: Nonlinear diffusion on point clouds ( ) ρ t = ρm ρ n X on X on X fast diffusion equation: m [1 1/d, 1) porous medium equation: m > 1 Gradient flow in (P(X), W 2 ). for U(ρ) = U(ρ(x)) d x with U(r) = rm m 1 [Otto] Algorithm: Input: µ 0 := x P 0 δ x P 0, τ > 0 For k {0,..., T } φ arg min φ K G X (P k ) 1 2τ W2 2(µ k, Hφ # µ k ) + U(Gφ # µ k ) µ k+1 G φ# µ k ; P k+1 spt(µ k+1 ) Newton s method x G φk (x) X P k X P k+1 20
72 Example 2: Crowd motion and congestion Gradient flow model of crowd motion with congestion, with a JKO scheme: [Maury-Roudneff-Chupin-Santambrogio 10] µ k+1 = min ν P(X) 1 2τ W2 2(µ k, ν) + E(ν) + U(ν) E(ν) := V (x) d ν(x) X { 0 if d ν/ d H d 1, U(ν) := + if not Prop: The congestion term U is convex under generalized displacements. 21
73 Example 2: Crowd motion and congestion Gradient flow model of crowd motion with congestion, with a JKO scheme: [Maury-Roudneff-Chupin-Santambrogio 10] µ k+1 = min ν P(X) 1 2τ W2 2(µ k, ν) + E(ν) + U(ν) E(ν) := V (x) d ν(x) X { 0 if d ν/ d H d 1, U(ν) := We solve this problem with a relaxed hard congestion term: + if not Prop: The congestion term U is convex under generalized displacements. Convex optimization problem if V is λ-convex (V + λ. 2 convex) and τ λ/2. U α (ρ) := ρ(x) α log(1 ρ(x) 1/d ) d x 6 r r α log(1 r 1/d ) 21 Prop: (i) U α is convex under gen. displacements Γ (ii) U α U as α. βu 1 Γ U as β α=1 α=5 α=10 r = 0 r = 1
74 Example 2: Crowd motion and congestion Initial density on X = [ 2, 2] 2 Potential 0 1 (2, 2) ( 2, 2) P = regular grid. V (x) = x (2, 0) exp( 5 x 2 /2) Algorithm: Input: µ 0 P(P ), τ > 0, α > 0, β 1. For k {0,..., T } φ arg min φ K G X (P k ) 1 2τ W2 2(µ k, Hφ # µ k ) + E(Hφ # µ k ) + αu β (Gφ # µ k ) ν G φ# µ k ; µ k+1 projection of ν [ 2,2) [ 2,2] on P. 22
75 23 4. Extension to Other Convexity-like Constraints
76 Support Functions of Convex Bodies Objective: Logarithmic barrier for the space of support functions of convex bodies. 24
77 Support Functions of Convex Bodies Objective: Logarithmic barrier for the space of support functions of convex bodies. interior point method for shape optimization problem: Minkowski, Meissner, etc. 24
78 Support Functions of Convex Bodies Objective: Logarithmic barrier for the space of support functions of convex bodies. Definition: Given a convex body K, h K : u S d 1 max p K u p. 24
79 Support Functions of Convex Bodies Objective: Logarithmic barrier for the space of support functions of convex bodies. Definition: Given a convex body K, h K : u S d 1 max p K u p. K s (P ) := {h K P ; K bounded convex body } n 1 n 2 n 5 n 3 n 4 P = {n 1,..., n N } S d 1 R d 24
80 Support Functions of Convex Bodies Objective: Logarithmic barrier for the space of support functions of convex bodies. Definition: Given a convex body K, h K : u S d 1 max p K u p. K s (P ) := {h K P ; K bounded convex body } K(h) n 1 n 2 h 1 h 2 n 5 n 3 h 5 h 3 h 4 n 4 P = {n 1,..., n N } S d 1 R d K(h) := N i=1 {x; x n i h i } 24
81 Support Functions of Convex Bodies Objective: Logarithmic barrier for the space of support functions of convex bodies. Definition: Given a convex body K, h K : u S d 1 max p K u p. K s (P ) := {h K P ; K bounded convex body } K(h) n 1 n 2 h 1 h 2 n 5 n 3 h 5 h 3 h 4 n 4 P = {n 1,..., n N } S d 1 R d K(h) := N i=1 {x; x n i h i } Prop: Φ(h) := N i=1 log(hd 1 (ith face of K(h))) is a convex barrier for K s (P ). 24
82 Support Functions of Convex Bodies Objective: Logarithmic barrier for the space of support functions of convex bodies. Definition: Given a convex body K, h K : u S d 1 max p K u p. K s (P ) := {h K P ; K bounded convex body } K(h) n 1 n 2 h 1 h 2 n 5 n 3 h 5 h 3 h 4 n 4 P = {n 1,..., n N } S d 1 R d K(h) := N i=1 {x; x n i h i } Prop: Φ(h) := N i=1 log(hd 1 (ith face of K(h))) is a convex barrier for K s (P ). Extension to (a) radial parameterization of convex bodies, (b) reflector surfaces, etc. 24
83 c-concave Functions Definition: φ : X R is c-concave if ψ : Y R s.t. φ = min y c(x, y) + ψ(y) Cost function: c : X Y R 25
84 c-concave Functions Definition: φ : X R is c-concave if ψ : Y R s.t. φ = min y c(x, y) + ψ(y) K c (P ) := {φ P ; φ : X R is c-concave } Cost function: c : X Y R 25
85 c-concave Functions Definition: φ : X R is c-concave if ψ : Y R s.t. φ = min y c(x, y) + ψ(y) K c (P ) := {φ P ; φ : X R is c-concave } Cost function: c : X Y R Characterization of the costs functions such that the space K c is convex Application: generalized principal-agent problem [Figalli, Kim, McCann 10] 25
86 c-concave Functions Definition: φ : X R is c-concave if ψ : Y R s.t. φ = min y c(x, y) + ψ(y) K c (P ) := {φ P ; φ : X R is c-concave } Cost function: c : X Y R Characterization of the costs functions such that the space K c is convex Application: generalized principal-agent problem [Figalli, Kim, McCann 10] Under the same hypotheses, there exists a convex logarithmic barrier for K c (P ): 25
87 c-concave Functions Definition: φ : X R is c-concave if ψ : Y R s.t. φ = min y c(x, y) + ψ(y) K c (P ) := {φ P ; φ : X R is c-concave } Cost function: c : X Y R Characterization of the costs functions such that the space K c is convex Application: generalized principal-agent problem [Figalli, Kim, McCann 10] Under the same hypotheses, there exists a convex logarithmic barrier for K c (P ): Voronoi diagram: Vor ψ c (p) = {x X; q P, c(x, p) + ψ(p) c(x, q) + ψ(q)} Vor ψ c (p) X 25
88 c-concave Functions Definition: φ : X R is c-concave if ψ : Y R s.t. φ = min y c(x, y) + ψ(y) K c (P ) := {φ P ; φ : X R is c-concave } Cost function: c : X Y R Characterization of the costs functions such that the space K c is convex Application: generalized principal-agent problem [Figalli, Kim, McCann 10] Under the same hypotheses, there exists a convex logarithmic barrier for K c (P ): Voronoi diagram: Vor ψ c (p) = {x X; q P, c(x, p) + ψ(p) c(x, q) + ψ(q)} exp 1 p (Vor ψ c (p)) R d is convex exp p := [ c(., p)] 1 Vor ψ c (p) X 25
89 c-concave Functions Definition: φ : X R is c-concave if ψ : Y R s.t. φ = min y c(x, y) + ψ(y) K c (P ) := {φ P ; φ : X R is c-concave } Cost function: c : X Y R Characterization of the costs functions such that the space K c is convex Application: generalized principal-agent problem [Figalli, Kim, McCann 10] Under the same hypotheses, there exists a convex logarithmic barrier for K c (P ): Voronoi diagram: Vor ψ c (p) = {x X; q P, c(x, p) + ψ(p) c(x, q) + ψ(q)} exp 1 p (Vor ψ c (p)) R d is convex exp p := [ c(., p)] 1 Vor ψ c (p) X Prop: Φ(h) := N p P log(hd (exp 1 p (Vor ψ c (p))) is a convex barrier for K c (P ). 25
Convex discretization of functionals involving the Monge-Ampère operator
Convex discretization of functionals involving the Monge-Ampère operator Quentin Mérigot CNRS / Université Paris-Dauphine Joint work with J.D. Benamou, G. Carlier and É. Oudet GeMeCod Conference October
More informationLagrangian discretization of incompressibility, congestion and linear diffusion
Lagrangian discretization of incompressibility, congestion and linear diffusion Quentin Mérigot Joint works with (1) Thomas Gallouët (2) Filippo Santambrogio Federico Stra (3) Hugo Leclerc Seminaire du
More informationGradient Flows: Qualitative Properties & Numerical Schemes
Gradient Flows: Qualitative Properties & Numerical Schemes J. A. Carrillo Imperial College London RICAM, December 2014 Outline 1 Gradient Flows Models Gradient flows Evolving diffeomorphisms 2 Numerical
More informationNumerical Optimal Transport and Applications
Numerical Optimal Transport and Applications Gabriel Peyré Joint works with: Jean-David Benamou, Guillaume Carlier, Marco Cuturi, Luca Nenna, Justin Solomon www.numerical-tours.com Histograms in Imaging
More informationThe semi-geostrophic equations - a model for large-scale atmospheric flows
The semi-geostrophic equations - a model for large-scale atmospheric flows Beatrice Pelloni, University of Reading with M. Cullen (Met Office), D. Gilbert, T. Kuna INI - MFE Dec 2013 Introduction - Motivation
More informationDiscrete Ricci curvature via convexity of the entropy
Discrete Ricci curvature via convexity of the entropy Jan Maas University of Bonn Joint work with Matthias Erbar Simons Institute for the Theory of Computing UC Berkeley 2 October 2013 Starting point McCann
More informationA Modest Proposal for MFG with Density Constraints
A Modest Proposal for MFG with Density Constraints Mean Field Games and related topics, Rome, May 011 Filippo Santambrogio October 31, 011 Abstract We consider a typical problem in Mean Field Games: the
More informationIntroduction to optimal transport
Introduction to optimal transport Nicola Gigli May 20, 2011 Content Formulation of the transport problem The notions of c-convexity and c-cyclical monotonicity The dual problem Optimal maps: Brenier s
More informationOptimal Transportation. Nonlinear Partial Differential Equations
Optimal Transportation and Nonlinear Partial Differential Equations Neil S. Trudinger Centre of Mathematics and its Applications Australian National University 26th Brazilian Mathematical Colloquium 2007
More informationRepresentation of the polar cone of convex functions and applications
Representation of the polar cone of convex functions and applications G. Carlier, T. Lachand-Robert October 23, 2006 version 2.1 Abstract Using a result of Y. Brenier [1], we give a representation of the
More informationA VARIATIONAL METHOD FOR THE ANALYSIS OF A MONOTONE SCHEME FOR THE MONGE-AMPÈRE EQUATION 1. INTRODUCTION
A VARIATIONAL METHOD FOR THE ANALYSIS OF A MONOTONE SCHEME FOR THE MONGE-AMPÈRE EQUATION GERARD AWANOU AND LEOPOLD MATAMBA MESSI ABSTRACT. We give a proof of existence of a solution to the discrete problem
More informationC 1 regularity of solutions of the Monge-Ampère equation for optimal transport in dimension two
C 1 regularity of solutions of the Monge-Ampère equation for optimal transport in dimension two Alessio Figalli, Grégoire Loeper Abstract We prove C 1 regularity of c-convex weak Alexandrov solutions of
More informationCONGESTED AGGREGATION VIA NEWTONIAN INTERACTION
CONGESTED AGGREGATION VIA NEWTONIAN INTERACTION KATY CRAIG, INWON KIM, AND YAO YAO Abstract. We consider a congested aggregation model that describes the evolution of a density through the competing effects
More informationBranched transport limit of the Ginzburg-Landau functional
Branched transport limit of the Ginzburg-Landau functional Michael Goldman CNRS, LJLL, Paris 7 Joint work with S. Conti, F. Otto and S. Serfaty Introduction Superconductivity was first observed by Onnes
More informationMinimal time mean field games
based on joint works with Samer Dweik and Filippo Santambrogio PGMO Days 2017 Session Mean Field Games and applications EDF Lab Paris-Saclay November 14th, 2017 LMO, Université Paris-Sud Université Paris-Saclay
More informationIntroduction to Optimal Transport Theory
Introduction to Optimal Transport Theory Filippo Santambrogio Grenoble, June 15th 2009 These very short lecture notes do not want to be an exhaustive presentation of the topic, but only a short list of
More informationAPPLICATIONS DU TRANSPORT OPTIMAL DANS LES JEUX À POTENTIEL
APPLICATIONS DU TRANSPORT OPTIMAL DANS LES JEUX À POTENTIEL Adrien Blanchet IAST/TSE/Université Toulouse 1 Capitole Journées SMAI-MODE 216 En collaboration avec G. Carlier & P. Mossay & F. Santambrogio
More informationA few words about the MTW tensor
A few words about the Ma-Trudinger-Wang tensor Université Nice - Sophia Antipolis & Institut Universitaire de France Salah Baouendi Memorial Conference (Tunis, March 2014) The Ma-Trudinger-Wang tensor
More informationOn the regularity of solutions of optimal transportation problems
On the regularity of solutions of optimal transportation problems Grégoire Loeper April 25, 2008 Abstract We give a necessary and sufficient condition on the cost function so that the map solution of Monge
More informationMean-Field optimization problems and non-anticipative optimal transport. Beatrice Acciaio
Mean-Field optimization problems and non-anticipative optimal transport Beatrice Acciaio London School of Economics based on ongoing projects with J. Backhoff, R. Carmona and P. Wang Thera Stochastics
More informationPARTIAL REGULARITY OF BRENIER SOLUTIONS OF THE MONGE-AMPÈRE EQUATION
PARTIAL REGULARITY OF BRENIER SOLUTIONS OF THE MONGE-AMPÈRE EQUATION ALESSIO FIGALLI AND YOUNG-HEON KIM Abstract. Given Ω, Λ R n two bounded open sets, and f and g two probability densities concentrated
More informationA DIFFUSIVE MODEL FOR MACROSCOPIC CROWD MOTION WITH DENSITY CONSTRAINTS
A DIFFUSIVE MODEL FOR MACROSCOPIC CROWD MOTION WITH DENSITY CONSTRAINTS Abstract. In the spirit of the macroscopic crowd motion models with hard congestion (i.e. a strong density constraint ρ ) introduced
More informationNumerical Methods for Optimal Transportation 13frg167
Numerical Methods for Optimal Transportation 13frg167 Jean-David Benamou (INRIA) Adam Oberman (McGill University) Guillaume Carlier (Paris Dauphine University) July 2013 1 Overview of the Field Optimal
More informationOn a Class of Multidimensional Optimal Transportation Problems
Journal of Convex Analysis Volume 10 (2003), No. 2, 517 529 On a Class of Multidimensional Optimal Transportation Problems G. Carlier Université Bordeaux 1, MAB, UMR CNRS 5466, France and Université Bordeaux
More informationGenerative Models and Optimal Transport
Generative Models and Optimal Transport Marco Cuturi Joint work / work in progress with G. Peyré, A. Genevay (ENS), F. Bach (INRIA), G. Montavon, K-R Müller (TU Berlin) Statistics 0.1 : Density Fitting
More informationFULL CHARACTERIZATION OF OPTIMAL TRANSPORT PLANS FOR CONCAVE COSTS
FULL CHARACTERIZATION OF OPTIMAL TRANSPORT PLANS FOR CONCAVE COSTS PAUL PEGON, DAVIDE PIAZZOLI, FILIPPO SANTAMBROGIO Abstract. This paper slightly improves a classical result by Gangbo and McCann (1996)
More informationarxiv: v1 [math.ap] 10 Apr 2013
QUASI-STATIC EVOLUTION AND CONGESTED CROWD TRANSPORT DAMON ALEXANDER, INWON KIM, AND YAO YAO arxiv:1304.3072v1 [math.ap] 10 Apr 2013 Abstract. We consider the relationship between Hele-Shaw evolution with
More informationSobolev regularity for the Monge-Ampère equation, with application to the semigeostrophic equations
Sobolev regularity for the Monge-Ampère equation, with application to the semigeostrophic equations Alessio Figalli Abstract In this note we review some recent results on the Sobolev regularity of solutions
More informationThe optimal partial transport problem
The optimal partial transport problem Alessio Figalli Abstract Given two densities f and g, we consider the problem of transporting a fraction m [0, min{ f L 1, g L 1}] of the mass of f onto g minimizing
More informationESTIMATES FOR THE MONGE-AMPERE EQUATION
GLOBAL W 2,p ESTIMATES FOR THE MONGE-AMPERE EQUATION O. SAVIN Abstract. We use a localization property of boundary sections for solutions to the Monge-Ampere equation obtain global W 2,p estimates under
More informationUNIQUENESS ISSUES FOR EVOLUTIVE EQUATIONS WITH DENSITY CONSTRAINTS
UNIQUENESS ISSUES FOR EVOLUTIVE EQUATIONS WITH DENSITY CONSTRAINTS SIMONE DI MARINO AND ALPÁR RICHÁRD MÉSZÁROS Abstract. In this paper we present some basic uniqueness results for evolutive equations under
More informationFree Energy, Fokker-Planck Equations, and Random walks on a Graph with Finite Vertices
Free Energy, Fokker-Planck Equations, and Random walks on a Graph with Finite Vertices Haomin Zhou Georgia Institute of Technology Jointly with S.-N. Chow (Georgia Tech) Wen Huang (USTC) Yao Li (NYU) Research
More informationLogarithmic Sobolev Inequalities
Logarithmic Sobolev Inequalities M. Ledoux Institut de Mathématiques de Toulouse, France logarithmic Sobolev inequalities what they are, some history analytic, geometric, optimal transportation proofs
More informationA description of transport cost for signed measures
A description of transport cost for signed measures Edoardo Mainini Abstract In this paper we develop the analysis of [AMS] about the extension of the optimal transport framework to the space of real measures.
More informationPATH FUNCTIONALS OVER WASSERSTEIN SPACES. Giuseppe Buttazzo. Dipartimento di Matematica Università di Pisa.
PATH FUNCTIONALS OVER WASSERSTEIN SPACES Giuseppe Buttazzo Dipartimento di Matematica Università di Pisa buttazzo@dm.unipi.it http://cvgmt.sns.it ENS Ker-Lann October 21-23, 2004 Several natural structures
More informationOn some nonlinear parabolic equation involving variable exponents
On some nonlinear parabolic equation involving variable exponents Goro Akagi (Kobe University, Japan) Based on a joint work with Giulio Schimperna (Pavia Univ., Italy) Workshop DIMO-2013 Diffuse Interface
More informationA Dirichlet problem in the strip
Electronic Journal of Differential Equations, Vol. 1996(1996), No. 10, pp. 1 9. ISSN: 1072-6691. URL: http://ejde.math.swt.edu or http://ejde.math.unt.edu ftp (login: ftp) 147.26.103.110 or 129.120.3.113
More informationOptimal Transport: A Crash Course
Optimal Transport: A Crash Course Soheil Kolouri and Gustavo K. Rohde HRL Laboratories, University of Virginia Introduction What is Optimal Transport? The optimal transport problem seeks the most efficient
More informationGRADIENT FLOWS FOR NON-SMOOTH INTERACTION POTENTIALS
GRADIENT FLOWS FOR NON-SMOOTH INTERACTION POTENTIALS J. A. CARRILLO, S. LISINI, E. MAININI Abstract. We deal with a nonlocal interaction equation describing the evolution of a particle density under the
More informationCurvature and the continuity of optimal transportation maps
Curvature and the continuity of optimal transportation maps Young-Heon Kim and Robert J. McCann Department of Mathematics, University of Toronto June 23, 2007 Monge-Kantorovitch Problem Mass Transportation
More informationA variational proof of partial regularity for optimal transportation maps between sets
A variational proof of partial regularity for optimal transportation maps between sets M. Goldman F. Otto October 24, 27 Abstract We provide a new proof of the known partial regularity result for the optimal
More informationJean-David Benamou 1, Guillaume Carlier 2 and Maxime Laborde 3
ESAIM: PROCEEDINGS AND SURVEYS, June 6, Vol. 54, p. -7 B. Düring, C.-B. Schönlieb and M.-T. Wolfram, Editors AN AUGMENTED LAGRANGIAN APPROACH TO WASSERSTEIN GRADIENT FLOWS AND APPLICATIONS Jean-David Benamou,
More informationDynamic and Stochastic Brenier Transport via Hopf-Lax formulae on Was
Dynamic and Stochastic Brenier Transport via Hopf-Lax formulae on Wasserstein Space With many discussions with Yann Brenier and Wilfrid Gangbo Brenierfest, IHP, January 9-13, 2017 ain points of the
More informationNumerical methods for Mean Field Games: additional material
Numerical methods for Mean Field Games: additional material Y. Achdou (LJLL, Université Paris-Diderot) July, 2017 Luminy Convergence results Outline 1 Convergence results 2 Variational MFGs 3 A numerical
More information1. Introduction Boundary estimates for the second derivatives of the solution to the Dirichlet problem for the Monge-Ampere equation
POINTWISE C 2,α ESTIMATES AT THE BOUNDARY FOR THE MONGE-AMPERE EQUATION O. SAVIN Abstract. We prove a localization property of boundary sections for solutions to the Monge-Ampere equation. As a consequence
More informationarxiv: v2 [math.oc] 25 Sep 2012
From Knothe s Rearrangement to Brenier s Optimal Transport Map arxiv:1205.1099v2 [math.oc] 25 Sep 2012 Nicolas Bonnotte Université Paris-Sud, Orsay Scuola Normale Superiore, Pisa May 1, 2014 (revised version)
More informationREGULARITY OF MONOTONE TRANSPORT MAPS BETWEEN UNBOUNDED DOMAINS
REGULARITY OF MONOTONE TRANSPORT MAPS BETWEEN UNBOUNDED DOMAINS DARIO CORDERO-ERAUSQUIN AND ALESSIO FIGALLI A Luis A. Caffarelli en su 70 años, con amistad y admiración Abstract. The regularity of monotone
More informationGradient Flow. Chang Liu. April 24, Tsinghua University. Chang Liu (THU) Gradient Flow April 24, / 91
Gradient Flow Chang Liu Tsinghua University April 24, 2017 Chang Liu (THU) Gradient Flow April 24, 2017 1 / 91 Contents 1 Introduction 2 Gradient flow in the Euclidean space Variants of Gradient Flow in
More informationGradient Flow in the Wasserstein Metric
3 2 1 Time Position -0.5 0.0 0.5 0 Graient Flow in the Wasserstein Metric Katy Craig University of California, Santa Barbara JMM, AMS Metric Geometry & Topology January 11th, 2018 graient flow an PDE Examples:
More informationReconstruction Scheme for Active Thermography
Reconstruction Scheme for Active Thermography Gen Nakamura gnaka@math.sci.hokudai.ac.jp Department of Mathematics, Hokkaido University, Japan Newton Institute, Cambridge, Sept. 20, 2011 Contents.1.. Important
More informationLECTURE 15: COMPLETENESS AND CONVEXITY
LECTURE 15: COMPLETENESS AND CONVEXITY 1. The Hopf-Rinow Theorem Recall that a Riemannian manifold (M, g) is called geodesically complete if the maximal defining interval of any geodesic is R. On the other
More informationHölder continuity for optimal multivalued mappings
Hölder continuity for optimal multivalued mappings R. J. McCann M. Sosio Abstract Gangbo and McCann showed that optimal transportation between hypersurfaces generally leads to multivalued optimal maps
More informationMoment Measures. Bo az Klartag. Tel Aviv University. Talk at the asymptotic geometric analysis seminar. Tel Aviv, May 2013
Tel Aviv University Talk at the asymptotic geometric analysis seminar Tel Aviv, May 2013 Joint work with Dario Cordero-Erausquin. A bijection We present a correspondence between convex functions and Borel
More information5 Measure theory II. (or. lim. Prove the proposition. 5. For fixed F A and φ M define the restriction of φ on F by writing.
5 Measure theory II 1. Charges (signed measures). Let (Ω, A) be a σ -algebra. A map φ: A R is called a charge, (or signed measure or σ -additive set function) if φ = φ(a j ) (5.1) A j for any disjoint
More informationOptimal Transport for Data Analysis
Optimal Transport for Data Analysis Bernhard Schmitzer 2017-05-16 1 Introduction 1.1 Reminders on Measure Theory Reference: Ambrosio, Fusco, Pallara: Functions of Bounded Variation and Free Discontinuity
More informationMoment Measures. D. Cordero-Erausquin 1 and B. Klartag 2
Moment Measures D. Cordero-Erausquin 1 and B. Klartag 2 Abstract With any convex function ψ on a finite-dimensional linear space X such that ψ goes to + at infinity, we associate a Borel measure µ on X.
More informationVariational approach to mean field games with density constraints
1 / 18 Variational approach to mean field games with density constraints Alpár Richárd Mészáros LMO, Université Paris-Sud (based on ongoing joint works with F. Santambrogio, P. Cardaliaguet and F. J. Silva)
More informationOptimal Transport for Applied Mathematicians
Optimal Transport for Applied Mathematicians Calculus of Variations, PDEs and Modelling Filippo Santambrogio 1 1 Laboratoire de Mathématiques d Orsay, Université Paris Sud, 91405 Orsay cedex, France filippo.santambrogio@math.u-psud.fr,
More informationarxiv: v2 [math.na] 7 Mar 2017
CONVERGENCE OF A NEWTON ALGORITHM FOR SEMI-DISCRETE OPTIMAL TRANSPORT JUN KITAGAWA, QUENTIN MÉRIGOT, AND BORIS THIBERT arxiv:1603.05579v2 [math.na] 7 Mar 2017 Abstract. A popular way to solve optimal transport
More informationNumerical Schemes for Calculating the Discrete Wasserstein Distance
Numerical Schemes for Calculating the Discrete Wasserstein Distance Benjamin Cabrera Born 9th April 99 in Groß-Gerau, Germany February 6, 6 Master s Thesis Mathematics Advisor: Prof. Dr. Martin Rumpf Mathematical
More informationEXAMPLE OF A FIRST ORDER DISPLACEMENT CONVEX FUNCTIONAL
EXAMPLE OF A FIRST ORDER DISPLACEMENT CONVEX FUNCTIONAL JOSÉ A. CARRILLO AND DEJAN SLEPČEV Abstract. We present a family of first-order functionals which are displacement convex, that is convex along the
More informationFrom Knothe s transport to Brenier s map and a continuation method for optimal transport
From Knothe s transport to Brenier s map and a continuation method for optimal transport G. Carlier, A. Galichon, F. Santambrogio November 4, 29 Abstract A simple procedure to map two probability measures
More informationNear-Potential Games: Geometry and Dynamics
Near-Potential Games: Geometry and Dynamics Ozan Candogan, Asuman Ozdaglar and Pablo A. Parrilo September 6, 2011 Abstract Potential games are a special class of games for which many adaptive user dynamics
More informationON STRICT CONVEXITY AND CONTINUOUS DIFFERENTIABILITY OF POTENTIAL FUNCTIONS IN OPTIMAL TRANSPORTATION
ON STRICT CONVEXITY AND CONTINUOUS DIFFERENTIABILITY OF POTENTIAL FUNCTIONS IN OPTIMAL TRANSPORTATION Neil Trudinger Xu-Jia Wang Centre for Mathematics and Its Applications The Australian National University
More informationRicci curvature for metric-measure spaces via optimal transport
Annals of athematics, 169 (2009), 903 991 Ricci curvature for metric-measure spaces via optimal transport By John Lott and Cédric Villani* Abstract We define a notion of a measured length space having
More informationHÖLDER CONTINUITY FOR OPTIMAL MULTIVALUED MAPPINGS
HÖLDER CONTINUITY FOR OPTIMAL MULTIVALUED MAPPINGS R. J. MCCANN AND M. SOSIO Abstract. Gangbo and McCann showed that optimal transportation between hypersurfaces generally leads to multivalued optimal
More informationThe Caratheodory Construction of Measures
Chapter 5 The Caratheodory Construction of Measures Recall how our construction of Lebesgue measure in Chapter 2 proceeded from an initial notion of the size of a very restricted class of subsets of R,
More informationFrom slow diffusion to a hard height constraint: characterizing congested aggregation
3 2 1 Time Position -0.5 0.0 0.5 0 From slow iffusion to a har height constraint: characterizing congeste aggregation Katy Craig University of California, Santa Barbara BIRS April 12, 2017 2 collective
More informationMartingale optimal transport with Monge s cost function
Martingale optimal transport with Monge s cost function Martin Klimmek, joint work with David Hobson (Warwick) klimmek@maths.ox.ac.uk Crete July, 2013 ca. 1780 c(x, y) = x y No splitting, transport along
More informationSeismic imaging and optimal transport
Seismic imaging and optimal transport Bjorn Engquist In collaboration with Brittany Froese, Sergey Fomel and Yunan Yang Brenier60, Calculus of Variations and Optimal Transportation, Paris, January 10-13,
More informationDeforming conformal metrics with negative Bakry-Émery Ricci Tensor on manifolds with boundary
Deforming conformal metrics with negative Bakry-Émery Ricci Tensor on manifolds with boundary Weimin Sheng (Joint with Li-Xia Yuan) Zhejiang University IMS, NUS, 8-12 Dec 2014 1 / 50 Outline 1 Prescribing
More informationMean field games via probability manifold II
Mean field games via probability manifold II Wuchen Li IPAM summer school, 2018. Introduction Consider a nonlinear Schrödinger equation hi t Ψ = h2 1 2 Ψ + ΨV (x) + Ψ R d W (x, y) Ψ(y) 2 dy. The unknown
More informationRegularity of local minimizers of the interaction energy via obstacle problems
Regularity of local minimizers of the interaction energy via obstacle problems J. A. Carrillo, M. G. Delgadino, A. Mellet September 22, 2014 Abstract The repulsion strength at the origin for repulsive/attractive
More informationSpaces with Ricci curvature bounded from below
Spaces with Ricci curvature bounded from below Nicola Gigli February 23, 2015 Topics 1) On the definition of spaces with Ricci curvature bounded from below 2) Analytic properties of RCD(K, N) spaces 3)
More informationA LOCALIZATION PROPERTY AT THE BOUNDARY FOR MONGE-AMPERE EQUATION
A LOCALIZATION PROPERTY AT THE BOUNDARY FOR MONGE-AMPERE EQUATION O. SAVIN. Introduction In this paper we study the geometry of the sections for solutions to the Monge- Ampere equation det D 2 u = f, u
More informationFree energy estimates for the two-dimensional Keller-Segel model
Free energy estimates for the two-dimensional Keller-Segel model dolbeaul@ceremade.dauphine.fr CEREMADE CNRS & Université Paris-Dauphine in collaboration with A. Blanchet (CERMICS, ENPC & Ceremade) & B.
More informationA Mean Field Equation as Limit of Nonlinear Diffusions with Fractional Laplacian Operators
A Mean Field Equation as Limit of Nonlinear Diffusions with Fractional Laplacian Operators Sylvia Serfaty and Juan Luis Vázquez June 2012 Abstract In the limit of a nonlinear diffusion model involving
More informationarxiv: v3 [stat.co] 22 Apr 2016
A fixed-point approach to barycenters in Wasserstein space Pedro C. Álvarez-Esteban1, E. del Barrio 1, J.A. Cuesta-Albertos 2 and C. Matrán 1 1 Departamento de Estadística e Investigación Operativa and
More informationMean Field Games on networks
Mean Field Games on networks Claudio Marchi Università di Padova joint works with: S. Cacace (Rome) and F. Camilli (Rome) C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, 2017
More informationOptimal Transport for Data Analysis
Optimal Transport for Data Analysis Bernhard Schmitzer 2017-05-30 1 Introduction 1.1 Reminders on Measure Theory Reference: Ambrosio, Fusco, Pallara: Functions of Bounded Variation and Free Discontinuity
More informationMicrolocal analysis and inverse problems Lecture 4 : Uniqueness results in admissible geometries
Microlocal analysis and inverse problems Lecture 4 : Uniqueness results in admissible geometries David Dos Santos Ferreira LAGA Université de Paris 13 Wednesday May 18 Instituto de Ciencias Matemáticas,
More informationComputing regularization paths for learning multiple kernels
Computing regularization paths for learning multiple kernels Francis Bach Romain Thibaux Michael Jordan Computer Science, UC Berkeley December, 24 Code available at www.cs.berkeley.edu/~fbach Computing
More informationII - REAL ANALYSIS. This property gives us a way to extend the notion of content to finite unions of rectangles: we define
1 Measures 1.1 Jordan content in R N II - REAL ANALYSIS Let I be an interval in R. Then its 1-content is defined as c 1 (I) := b a if I is bounded with endpoints a, b. If I is unbounded, we define c 1
More informationFokker-Planck Equation on Graph with Finite Vertices
Fokker-Planck Equation on Graph with Finite Vertices January 13, 2011 Jointly with S-N Chow (Georgia Tech) Wen Huang (USTC) Hao-min Zhou(Georgia Tech) Functional Inequalities and Discrete Spaces Outline
More informationOn a Fractional Monge Ampère Operator
Ann. PDE (015) 1:4 DOI 10.1007/s40818-015-0005-x On a Fractional Monge Ampère Operator Luis Caffarelli 1 Fernando Charro Received: 16 November 015 / Accepted: 19 November 015 / Published online: 18 December
More information1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),
Real Analysis 2, Math 651, Spring 2005 April 26, 2005 1 Real Analysis 2, Math 651, Spring 2005 Krzysztof Chris Ciesielski 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer
More informationLecture 1: Entropy, convexity, and matrix scaling CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: January 24, 2016
Lecture 1: Entropy, convexity, and matrix scaling CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: January 24, 2016 1 Entropy Since this course is about entropy maximization,
More informationREGULARITY OF POTENTIAL FUNCTIONS IN OPTIMAL TRANSPORTATION. Centre for Mathematics and Its Applications The Australian National University
ON STRICT CONVEXITY AND C 1 REGULARITY OF POTENTIAL FUNCTIONS IN OPTIMAL TRANSPORTATION Neil Trudinger Xu-Jia Wang Centre for Mathematics and Its Applications The Australian National University Abstract.
More informationarxiv: v1 [math.ca] 20 Sep 2010
Introduction to Optimal Transport Theory arxiv:1009.3856v1 [math.ca] 20 Sep 2010 Filippo Santambrogio Grenoble, June 15th, 2009 Revised version : March 23rd, 2010 Abstract These notes constitute a sort
More informationDisplacement convexity of the relative entropy in the discrete h
Displacement convexity of the relative entropy in the discrete hypercube LAMA Université Paris Est Marne-la-Vallée Phenomena in high dimensions in geometric analysis, random matrices, and computational
More informationNEW FUNCTIONAL INEQUALITIES
1 / 29 NEW FUNCTIONAL INEQUALITIES VIA STEIN S METHOD Giovanni Peccati (Luxembourg University) IMA, Minneapolis: April 28, 2015 2 / 29 INTRODUCTION Based on two joint works: (1) Nourdin, Peccati and Swan
More informationA Semi-Lagrangian discretization of non linear fokker Planck equations
A Semi-Lagrangian discretization of non linear fokker Planck equations E. Carlini Università Sapienza di Roma joint works with F.J. Silva RICAM, Linz November 2-25, 206 / 3 Outline A Semi-Lagrangian scheme
More informationOptimal Transportation and Economic Applications
Lecture Notes Optimal Transportation and Economic Applications Guillaume CARLIER IMA, New Mathematical Models in Economics and Finance, June 2010 2 3 Contents 1 Introduction to optimal transportation 6
More informationNumerical Approximation of L 1 Monge-Kantorovich Problems
Rome March 30, 2007 p. 1 Numerical Approximation of L 1 Monge-Kantorovich Problems Leonid Prigozhin Ben-Gurion University, Israel joint work with J.W. Barrett Imperial College, UK Rome March 30, 2007 p.
More informationFast convergent finite difference solvers for the elliptic Monge-Ampère equation
Fast convergent finite difference solvers for the elliptic Monge-Ampère equation Adam Oberman Simon Fraser University BIRS February 17, 211 Joint work [O.] 28. Convergent scheme in two dim. Explicit solver.
More informationarxiv: v1 [math.ap] 3 Sep 2014
L 2 A NUMERICAL ALGORITHM FOR SEMI-DISCRETE OPTIMAL TRANSPORT IN 3D BRUNO LÉVY arxiv:1409.1279v1 [math.ap] 3 Sep 2014 Abstract. This paper introduces a numerical algorithm to compute the L 2 optimal transport
More informationOn a theorem of Alexandrov
On a theorem of Alexandrov G. Carlier 27th January 2004 Abstract We give an elementary variational proof of classical theorems of Minkowski and Alexandrov on the existence and uniqueness, up to translations,
More informationc 2017 Michael J. Lindsey and Yanir A. Rubinstein
SIAM J. MATH. ANAL. Vol. 49, No. 4, pp. 3073 3124 c 2017 Michael J. Lindsey and Yanir A. Rubinstein OPTIMAL TRANSPORT VIA A MONGE AMPÈRE OPTIMIZATION PROBLEM MICHAEL LINDSEY AND YANIR A. RUBINSTEIN Abstract.
More informationConvergence to equilibrium of Markov processes (eventually piecewise deterministic)
Convergence to equilibrium of Markov processes (eventually piecewise deterministic) A. Guillin Université Blaise Pascal and IUF Rennes joint works with D. Bakry, F. Barthe, F. Bolley, P. Cattiaux, R. Douc,
More informationPenalized Barycenters in the Wasserstein space
Penalized Barycenters in the Wasserstein space Elsa Cazelles, joint work with Jérémie Bigot & Nicolas Papadakis Université de Bordeaux & CNRS Journées IOP - Du 5 au 8 Juillet 2017 Bordeaux Elsa Cazelles
More information