paper

The planar Least Gradient problem in convex domains

arXiv:1712.07150

Abstract

We study the two dimensional least gradient problem in a convex, but not necessary strictly convex region. We look for solutions in the space of functions satisfying the boundary data in trace sense. We assume that is in too. We state admissibility conditions on the trace and on the domain that are sufficient for existence of solutions.

The planar Least Gradient problem in convex domains · wovepaper