The Sattinger iteration method for 1-Laplace type problems and its application to concave-convex nonlinearities
Antonio J. Mart\'inez Aparicio, Francescantonio Oliva, Francesco, Petitta

TL;DR
This paper extends the Sattinger iteration method to solve 1-Laplace boundary value problems, overcoming structural challenges, and applies it to establish existence and non-existence results for concave-convex nonlinearities.
Contribution
It introduces a perturbation approach to adapt the Sattinger iteration for 1-Laplace problems and proves a weak comparison principle for these cases.
Findings
Established existence of solutions for concave-convex problems.
Proved non-existence results under certain conditions.
Extended the Sattinger iteration method to 1-Laplace problems.
Abstract
In this paper we extend the classical sub-supersolution Sattinger iteration method to -Laplace type boundary value problems of the form \begin{equation*} \begin{cases} \displaystyle -\Delta_1 u = F(x,u) & \text{in}\;\Omega,\\ \newline u=0 & \text{on}\;\partial\Omega, \end{cases} \end{equation*} where is an open bounded domain of () with Lipschitz boundary and is a Carathe\'{o}dory function. This goal is achieved through a perturbation method that overcomes structural obstructions arising from the presence of the -Laplacian and by proving a weak comparison principle for these problems. As a significant application of our main result we establish existence and non-existence theorems for the so-called ``concave-convex'' problem involving the -Laplacian as leading term.
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
TopicsNumerical methods in inverse problems · Mathematical Inequalities and Applications · Advanced Optimization Algorithms Research
