Related papers: A note on some Poincar\'e inequalities on convex s…
We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
In this Doctoral Dissertation we propose new variational principles for traffic assignment problems. So to find equillibrium we have to solve large-scale convex optimization problem of special (multilevel) type. We propose different…
The Calder\'on problem consists in recovering an unknown coefficient of a partial differential equation from boundary measurements of its solution. These measurements give rise to a highly nonlinear forward operator. As a consequence, the…
We study a dynamic optimal transport type problem on a domain that consists of two parts: a compact set $\Omega \subset \mathbb{R}^d$ (bulk) and a non-intersecting and sufficiently regular curve $\Gamma \subset \Omega$. On each of them, a…
We construct a transport map from Poisson point processes onto ultra-log-concave measures over the natural numbers, and show that this map is a contraction. Our approach overcomes the known obstacles to transferring functional inequalities…
We develop a novel theoretical framework for understating OT schemes respecting a class structure. For this purpose, we propose a convex OT program with a sum-of-norms regularization term, which provably recovers the underlying class…
We give a new probabilistic construction of solutions to real Monge-Amp\`ere equations in R^n satisfying the second boundary value problem with respect to a given target convex body P) which fits naturally into the theory of optimal…
This paper considers two types of boundary control problems for linear transport equations. The first one shows that transport solutions on a subdomain of a domain X can be controlled exactly from incoming boundary conditions for X under…
In this paper, we establish a global regularity result for the optimal transport problem with the quadratic cost, where the domains may not be convex. This result is obtained by a perturbation argument, using a recent global regularity of…
Motivated by a long-standing conjecture of Polya and Szeg\"o about the Newtonian capacity of convex bodies, we discuss the role of concavity inequalities in shape optimization, and we provide several counterexamples to the…
This article reviews the use of first order convex optimization schemes to solve the discretized dynamic optimal transport problem, initially proposed by Benamou and Brenier. We develop a staggered grid discretization that is well adapted…
In this work, we develop a collection of novel methods for the entropic-regularised optimal transport problem, which are inspired by existing mirror descent interpretations of the Sinkhorn algorithm used for solving this problem. These are…
We prove a sharp global $W^{2,\,p}$ estimate for potentials of optimal transport maps that take a certain class of non-convex planar domains to convex ones.
We extend the dimension free Talagrand inequalities for convex distance \cite{talagrand:1995} using an extension of Marton's weak transport \cite{marton:1996a} to other metrics than the Hamming distance. We study the dual form of these weak…
Optimal transport problems pose many challenges when considering their numerical treatment. We investigate the solution of a PDE-constrained optimisation problem subject to a particular transport equation arising from the modelling of image…
We present a unified strategy to derive Hardy-Poincar\'e inequalities on bounded and unbounded domains. The approach allows proving a general Hardy-Poincar\'e inequality from which the classical Poincar\'e and Hardy inequalities immediately…
We introduce and analyze a statistical estimator for Monge transport maps: solutions to the quadratic optimal transport problem in Euclidean space. For absolutely continuous source measures, this map is uniquely defined as the gradient of a…
Let $L=\DD+Z$ for a $C^1$ vector field $Z$ on a complete Riemannian manifold possibly with a boundary. By using the uniform distance, a number of transportation-cost inequalities on the path space for the (reflecting) $L$-diffusion process…
A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…
In this work we study a modification of the Monge-Kantorovich problem taking into account path dependence and interaction effects between particles. We prove existence of solutions under mild conditions on the data, and after imposing…