Lp bounds for boundary-to-boundary transport densities, and W1,p bounds for the BV least gradient problem in 2D.

Dweik, Samer; Santambrogio, Filippo

The least gradient problem (minimizing the total variation with given boundary data) is equivalent, in the plane, to the Beckmann minimal-flow problem with source and target measures located on the boundary of the domain, which is in turn related to an optimal transport problem. Motivated by this fact, we prove Lp summability results for the solution of the Beckmann problem in this setting, which improve upon previous results where the measures were themselves supposed to be  Lp. In the plane, we carry out all the analysis for general strictly convex norms, which requires to first introduce the corresponding optimal transport tools. We then obtain results about the W1,p regularity of the solution of the anisotropic least gradient problem in uniformly convex domains.

CONVEX domains; MATHEMATICAL bounds; MATHEMATICAL proofs; SUMMABILITY theory; PROBLEM solving

Calculus of Variations & Partial Differential Equations, 2019, Vol 58, Issue 1, p1

0944-2669

Academic Journal

10.1007/s00526-018-1474-z