A priori error analysis of the proximal Galerkin method
The proximal Galerkin (PG) method is a finite element method for solving variational problems with inequality constraints. It has several advantages, including constraint-preserving approximations and mesh independence. This paper presents the first abstract a priori error analysis of the PG method, providing a general framework to establish convergence and error estimates. As applications of the framework, we demonstrate optimal convergence rates with respect to the assumed regularity for both the obstacle and Signorini problems using various finite element subspaces.