This paper presents an iterative method for solving a semilinear obstacle problem on the boundary. The approach begins by approximating the problem using a penalty method, transforming it from a problem of the first kind to a sequence of problems of the second kind. The convergence of these approximations is then proven. The approximate problem is reformulated as a set-valued problem and expressed in a mixed formulation, leveraging the sub-differential of a continuous convex function to characterize the contact domain with the obstacle. Finally, we show that both the approximate solution and sub-differential can be effectively computed using an appropriate projection/fixed-point algorithm.
In this paper, we present a relatively complete analysis of the regularization method for of the bilateral obstacle problem with a non-homogeneous condition on the boundary. We provide both the convergence result and a priori estimates. Then by the duality theory from the convex analysis, we determine the dual problem associated with the of the bilateral obstacle problem. Based on this dual problem, we provide a posteriori error estimates for the continuous and the discrete problems. The a posteriori error estimates are desired for the practical implementation of the regularized problem.