相关论文: A fractal shape optimization problem in branched t…
Consider a simple finite graph and its nodes to represent identical water barrels (containing different amounts of water) on a level plane. Each edge corresponds to a (locked, water-filled) pipe connecting two barrels below the plane. We…
The paper studies a class of variational problems, modeling optimal shapes for tree roots. Given a measure $\mu$ describing the distribution of root hair cells, we seek to maximize a harvest functional $\mathcal{H}$, computing the total…
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…
This article generalizes the study of branched/ramified optimal transportation to those with capacity constraints. Each admissible transport network studied here is represented by a transport multi-path between measures, with a capacity…
We study the convergence of entropically regularized optimal transport to optimal transport. The main result is concerned with the convergence of the associated optimizers and takes the form of a large deviations principle quantifying the…
We study the optimal transport problem in the Euclidean space where the cost function is given by the value function associated with a Linear Quadratic minimization problem. Under appropriate assumptions, we generalize Brenier's Theorem…
In this paper, we study the role of boundary conditions on the optimal shape of a dyadic tree in which flows a Newtonian fluid. Our optimization problem consists in finding the shape of the tree that minimizes the viscous energy dissipated…
We investigate the 1D version of the notable Bressan's mixing conjecture, and introduce various formulation in the classical optimal transport setting, the branched optimal transport setting and a combinatorial optimization. In the discrete…
In this paper we study the regularity of the optimal sets for the shape optimization problem \[ \min\Big\{\lambda_1(\Omega)+\dots+\lambda_k(\Omega)\ :\ \Omega\subset\mathbb{R}^d,\ \text{open}\ ,\ |\Omega|=1\Big\}, \] where…
In this article we study optimization problems ruled by $\alpha$-fractional diffusion operators with volume constraints. By means of penalization techniques we prove existence of solutions. We also show that every solution is locally of…
We investigate the minimum cost of a wide class of combinatorial optimization problems over random bipartite geometric graphs in $\mathbb{R}^d$ where the edge cost between two points is given by a $p$-th power of their Euclidean distance.…
We consider an optimal transport problem on the unit simplex whose solutions are given by gradients of exponentially concave functions and prove two main results. First, we show that the optimal transport is the large deviation limit of a…
In this paper we consider the branched transportation problem in 2D associated with a cost per unit length of the form $1 + \alpha m$ where $m$ denotes the amount of transported mass and $\alpha > 0$ is a fixed parameter (notice that the…
This article revolves around shape and topology optimization, in the applicative context where the objective and constraint functionals depend on the solution to a physical boundary value problem posed on the optimized domain. We introduce…
We examine the optimal mass transport problem in $\mathbb{R}^{n}$ between densities having independent compact support by considering the geometry of a continuous interpolating support boundary in space-time within which the mass density…
We consider the well-known following shape optimization problem: $$\lambda_1(\Omega^*)=\min_{\stackrel{|\Omega|=a} {\Omega\subset{D}}} \lambda_1(\Omega), $$ where $\lambda_1$ denotes the first eigenvalue of the Laplace operator with…
We investigate the problem of efficiently computing optimal transport (OT) distances, which is equivalent to the node-capacitated minimum cost maximum flow problem in a bipartite graph. We compare runtimes in computing OT distances on data…
We extend a dimensional upper bound on how much an optimal transport map can degenerate for the quadratic transportation cost, originally due to Caffarelli, to cost functions that satisfy the curvature condition of Ma, Trudinger, and Wang.
We consider Monge-Kantorovich optimal transport problems on $\mathbb{R}^d$, $d\ge 1$, with a convex cost function given by the cumulant generating function of a probability measure. Examples include the Wasserstein-2 transport whose cost…
Consider transportation of one distribution of mass onto another, chosen to optimize the total expected cost, where cost per unit mass transported from x to y is given by a smooth function c(x,y). If the source density f^+(x) is bounded…