Double obstacle problems and fully nonlinear PDE with non-strictly convex gradient constraints

Abstract

We prove the optimal W2, ∞ regularity for fully nonlinear elliptic equations with convex gradient constraints. We do not assume any regularity about the constraints; so the constraints need not be C1 or strictly convex. We also show that the optimal regularity holds up to the boundary. Our approach is to show that these elliptic equations with gradient constraints are related to some fully nonlinear double obstacle problems. Then we prove the optimal W2, ∞ regularity for the double obstacle problems. In this process, we also employ the monotonicity property for the second derivative of obstacles, which we have obtained in a previous work.

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…