Abstract. We prove that the optimal transportation mapping that takes a Gaussian measure γ on an infinite dimensional space to an equivalent probability measure g · γ satisfies the Monge–Ampère equation provided that log g ∈ L1(γ) and g log g ∈ L1(γ). 1. Introduction and Main Result The Monge–Kantorovich problem and the Monge–Ampère equation have become a very popular object of research in the last decade (see [1], [15], [20], where one can find addi-tional references). In the finite dimensional case, considerable progress has been achieved by Brenier [5] and McCann [13], whose works stimulated a growing flow of publications
Abstract. In this series of lectures we introduce the Monge-Kantorovich problem of optimally transpo...
A simple procedure to map two probability measures in R^d is the so-called Knothe-Rosenblatt rearran...
A simple procedure to map two probability measures in Rd is the so-called Knothe-Rosenblatt rearrang...
We survey old and new regularity theory for the Monge-Ampère equation, show its connection to optima...
We survey old and new regularity theory for the Monge-Ampère equation, show its connection to optima...
Abstract. We survey old and new regularity theory for the Monge-Ampère equation, show its connectio...
The aim of this paper is to obtain quantitative bounds for solutions to the optimal matching problem...
We consider some recent regularity results for the Monge-Ampère equation arising in the optimal tran...
A simple procedure to map two probability measures in ℝd is the so-called \emph{Knothe-Rosenblatt re...
AbstractWe generalize Talagrand's inequality in the theory of optimal transport and give some applic...
AbstractIn this work we prove that the unique 1-convex solution of the Monge–Kantorovitch measure tr...
In this thesis we study the regularity problem in optimal transportation, by establishing the a prio...
Regularity in optimal transportation In this talk, we give some estimates for solutions to the Monge...
Abstract. In this series of lectures we introduce the Monge-Kantorovich problem of optimally transpo...
We study the entropic regularization of the optimal transport problem in dimension 1 when the cost f...
Abstract. In this series of lectures we introduce the Monge-Kantorovich problem of optimally transpo...
A simple procedure to map two probability measures in R^d is the so-called Knothe-Rosenblatt rearran...
A simple procedure to map two probability measures in Rd is the so-called Knothe-Rosenblatt rearrang...
We survey old and new regularity theory for the Monge-Ampère equation, show its connection to optima...
We survey old and new regularity theory for the Monge-Ampère equation, show its connection to optima...
Abstract. We survey old and new regularity theory for the Monge-Ampère equation, show its connectio...
The aim of this paper is to obtain quantitative bounds for solutions to the optimal matching problem...
We consider some recent regularity results for the Monge-Ampère equation arising in the optimal tran...
A simple procedure to map two probability measures in ℝd is the so-called \emph{Knothe-Rosenblatt re...
AbstractWe generalize Talagrand's inequality in the theory of optimal transport and give some applic...
AbstractIn this work we prove that the unique 1-convex solution of the Monge–Kantorovitch measure tr...
In this thesis we study the regularity problem in optimal transportation, by establishing the a prio...
Regularity in optimal transportation In this talk, we give some estimates for solutions to the Monge...
Abstract. In this series of lectures we introduce the Monge-Kantorovich problem of optimally transpo...
We study the entropic regularization of the optimal transport problem in dimension 1 when the cost f...
Abstract. In this series of lectures we introduce the Monge-Kantorovich problem of optimally transpo...
A simple procedure to map two probability measures in R^d is the so-called Knothe-Rosenblatt rearran...
A simple procedure to map two probability measures in Rd is the so-called Knothe-Rosenblatt rearrang...