Optimal Transport with Branching Distance Costs and the Obstacle Problem
نویسندگان
چکیده
منابع مشابه
Optimal Transport with Branching Distance Costs and the Obstacle Problem
We address the Monge problem in metric spaces with a geodesic distance: (X, d) is a Polish space and dN is a geodesic Borel distance which makes (X, dN ) a possibly branching geodesic space. We show that under some assumptions on the transference plan we can reduce the transport problem to transport problems along family of geodesics. We introduce three assumptions on a given dN -monotone trans...
متن کاملA Strategy for Non-strictly Convex Distance Transport Cost and the Obstacle Problem
We address the Monge problem in metric spaces with a geodesic distance: (X, d) is a Polish space and dN is a geodesic Borel distance which makes (X, dN ) a possibly branching geodesic space. We show that under some assumptions on the transference plan we can reduce the transport problem to transport problems along family of geodesics. We introduce two assumptions on the transference plan π whic...
متن کاملAdaptive Optimal Control of the Obstacle Problem
The article is concerned with the derivation of a posteriori error estimates for optimization problems subject to an obstacle problem. To circumvent the nondifferentiability inherent to this type of problem, we introduce a sequence of penalized but differentiable problem. We show differentiability of the central path and derive separate a posteriori dual weighted residual estimates for the erro...
متن کاملOptimal Regularity in Rooftop-like Obstacle Problem
We study the regularity of solutions of the obstacle problem when the obstacle is smooth on each half of the unit ball but only Lipschitz across the shared boundary. We prove that the optimal regularity of these solutions is C 1 2 up to the shared boundary on each half of the unit ball. The proof uses a modification of Almgren’s frequency formula.
متن کاملThe optimal partial transport problem
Given two densities f and g, we consider the problem of transporting a fraction m ∈ [0, min{‖f‖L1 , ‖g‖L1}] of the mass of f onto g minimizing a transportation cost. If the cost per unit of mass is given by |x − y|2, we will see that uniqueness of solutions holds for m ∈ [‖f ∧ g‖L1 , min{‖f‖L1 , ‖g‖L1}]. This extends the result of Caffarelli and McCann in [8], where the authors consider two den...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Mathematical Analysis
سال: 2012
ISSN: 0036-1410,1095-7154
DOI: 10.1137/100801433