Least gradient problem with respect to a non-strictly convex norm

Abstract

We study the planar least gradient problem with respect to an anisotropic norm φ for continuous boundary data. We prove existence of minimizers for strictly convex domains . Furthermore, we inspect the issue of uniqueness and regularity of minimizers only in terms of the modes of convexity of φ and . The results are independent from the regularity of φ.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…