A finite difference approach to solve obstacle-type problems using complementarity models

This paper focuses on elaborating practical finite difference schemes to reduce the computational cost incurred in the construction of large sparse matrices. Our methodology generates a sequence of lower-dimensional vectors to mitigate this cost. In addition, we test our approach on obstacle-type problems in its equivalent version of a complementarity model