(Non)uniqueness of minimizers in the least gradient problem

From MaRDI portal



Abstract: Minimizers in the least gradient problem with discontinuous boundary data need not be unique. However, all of them have a similar structure of level sets. Here, we give a full characterization of the set of minimizers in terms of any one of them and discuss stability properties of an approximate problem.


The author studies the following least gradient problem: \[ \min\int_\Omega |Du|,\text{ subject to }u\in\Omega,\, Tu=f, \] where T denotes a trace operator, \(u\) is a function with bounded variations and \(\Omega\subset R^k\) is a convex in an open bounded convex set with Lipschitz boundary. The main result of the paper is the proof of uniqueness of solutions to the least gradient problem except a set where the solution is locally constant. Unlike to previously published results in the literature, the present proof requires only convexity in place of some form of strict convexity of \(\Omega\). Further an approximation of the least gradient problem is investigated.




Cited in
(24)








This page was built for publication: (Non)uniqueness of minimizers in the least gradient problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1791545)