paper

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

arXiv:1907.04683

Abstract

We prove the optimal 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 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 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.

The previous title of this article was "Fully nonlinear elliptic equations with non-strictly convex gradient constraints, and fully nonlinear double obstacle problems". 35 pages. arXiv admin note: substantial text overlap with arXiv:1807.01590

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