Indexed metadata

The constrained least gradient problem in 𝑅ⁿ

Peter Sternberg, Graham Williams, William P. Ziemer

Source record

Source: Crossref

Published: Jan 1, 1993

DOI: 10.1090/s0002-9947-1993-1126213-2

Open original source ↗

Source abstract

We consider the constrained least gradient problem inf∫Ω∣∇u∣dx:u∈C0,1(Ω¯),∣∇u∣≤1a.e.,u=gon∂Ωinf⁡{∫Ω∣∇u∣dx:u∈C0,1(Ωˉ),∣∇u∣≤1  a.e.,u=g  on  ∂Ω} inf { ∫ Ω | ∇ u | d x : u ∈ C 0 , 1 ( Ω ¯ ) , | ∇ u | ≤ 1 a.e. , u = g on ∂ Ω } \inf \left \{ {\int _\Omega {|\nabla u|dx:u \in {C^{0,1}}(\bar \Omega ),\quad |\nabla u| \leq 1\;{\text {a.e.}},u = g\;{\text {on}}\;\partial \Omega } } \right \} which arises as the relaxation of a nonconvex problem in optimal design. We establish the existence of a solution by an explicit construction in which each level set is required to solve an obstacle problem. We also establish the uniqueness of solutions and discuss their structure.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

The constrained least gradient problem in 𝑅ⁿ — Mathematical Frontier Network