Related papers: A fractal shape optimization problem in branched t…
We consider the problem of finding optimal shapes of fluid domains. The fluid obeys the Navier--Stokes equations. Inside a holdall container we use a phase field approach using diffuse interfaces to describe the domain of free flow. We…
In its most general form, the optimal transport problem is an infinite-dimensional optimization problem, yet certain notable instances admit closed-form solutions. We identify the common source of this tractability as \textit{symmetry} and…
The optimal transport problem has recently developed into a powerful framework for various applications in estimation and control. Many of the recent advances in the theory and application of optimal transport are based on regularizing the…
In many low-dimensional dynamical systems transport coefficients are very irregular, perhaps even fractal functions of control parameters. To analyse this phenomenon we study a dynamical system defined by a piece-wise linear map and…
The paper analyzes a mollification algorithm, for the numerical computation of optimal irrigation patterns. This provides a regularization of the standard irrigation cost functional, in a Lagrangian framework. Lower semicontinuity and…
This paper studies optimal spatial layout of transshipment facilities and the corresponding service regions on an infinite homogeneous plane $\mathbb{R}^2$ that minimize the total cost for facility set-up, outbound delivery and inbound…
In this paper we analyze a mass transportation problem in a bounded domain with the possibility to transport mass to/from the boundary, paying the transport cost, that is given by the Euclidean distance plus an extra cost depending on the…
We address optimal control problems on the space of measures for an objective containing a smooth functional and an optimal transport regularization. That is, the quadratic Monge-Kantorovich distance between a given prior measure and the…
Beckmann's problem in optimal transport minimizes the total squared flux in a continuous transport problem from a source to a target distribution. In this article, the regularity theory for solutions to Beckmann's problem in optimal…
In this paper, we are interested in shape optimization problems involving the ge ometry (normal, curvatures) of the surfaces. We consider a class of hypersurface s in $\mathbb{R}^{n}$ satisfying a uniform ball condition and we prove the…
A variant of the classical optimal transportation problem is: among all joint measures with fixed marginals and which are dominated by a given density, find the optimal one. Existence and uniqueness of solutions to this variant were…
In this paper, we obtain some regularities of the free boundary in optimal transportation with the quadratic cost. Our first result is about the $C^{1,\alpha}$ regularity of the free boundary for optimal partial transport between convex…
Motivated by the Swampland Distance Conjecture, we study distances in field space using the framework of Optimal Transport. The associated optimisation problem naturally leads to a notion of distance in terms of a (generalised) Wasserstein…
The optimal (Monge-Kantorovich) transportation problem is discussed from several points of view. The Lagrangian formulation extends the action of the {\em Lagrangian} $L(v,x,t)$ from the set of orbits in $\R^n$ to a set of measure-valued…
We revisit a classical airfoil design problem: the search for shapes that maximize aerodynamic performance metrics, targeting the underexplored intermediate Reynolds-number regime between 1 and 3000, relevant to small animals and miniature…
Our concern is the computation of optimal shapes in problems involving $\(-\Delta)^{1/2}$. We focus on the energy $J(\Omega)$ associated to the solution $u\_\Omega$ of the basic Dirichlet problem $(-\Delta)^{1/2} u\_\Omega = 1$ in $\Omega$,…
Consider a transportation problem with sets of sources and sinks. There are profits and prices on the edges. The goal is to maximize the profit while meeting the following constraints; the total flow going out of a source must not exceed…
In recent work arXiv:2109.07820 we have shown the equivalence of the widely used nonconvex (generalized) branched transport problem with a shape optimization problem of a street or railroad network, known as (generalized) urban planning…
We investigate a first-order mean field planning problem of the form \begin{equation} \left\lbrace\begin{aligned} -\partial_t u + H(x,Du) &= f(x,m) &&\text{in } (0,T)\times \mathbb{R}^d, \\ \partial_t m - \nabla\cdot (m\,H_p(x,Du)) &= 0…
In order to circumvent the difficulties in solving numerically the discrete optimal transport problem, in which one minimizes the linear target function $P\mapsto\langle C,P\rangle:=\sum_{i,j}C_{ij}P_{ij}$, Cuturi introduced a variant of…