A Variational Approach to a $L^1$-Minimization Problem Based on the Milman-Pettis Theorem
Alexander Hach

TL;DR
This paper introduces a variational method for solving an $L^1$-minimization problem related to the Nash inequality, utilizing the Milman-Pettis theorem to handle non-reflexivity of $L^1$ spaces.
Contribution
It develops a novel variational framework for $L^1$-minimization problems using the Milman-Pettis theorem, addressing non-reflexivity and deriving explicit Euler-Lagrange equations.
Findings
Minimizers are compactly supported solutions to the inhomogeneous Helmholtz equation.
The approach accounts for the non-reflexivity of $L^1$ spaces.
Scaling behavior of solutions in parameter $eta$ is analyzed.
Abstract
We develop a variational approach to the minimization problem of functionals of the type constrained by which is related to the characterization of cases satisfying the sharp Nash inequality. Employing theory of uniform convex spaces by Clarkson and the Milman-Pettis theorem we are able account for the non-reflexivity of and implement the direct method of calculus of variations. By deriving the Euler-Lagrange equation we verify that the minimizers are up to rearrangement compactly supported solutions to the inhomogeneous Helmholtz equation and we study their scaling behaviour in .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNonlinear Partial Differential Equations · Mathematical Inequalities and Applications · Numerical methods in inverse problems
