Abstract

In this paper, we develop an enhanced version of the catching-up algorithm for sweeping processes through an appropriate concept of approximate projection. We establish some properties of this notion of approximate projection. Then, under suitable assumptions, we show the convergence of the enhanced catching-up algorithm for prox-regular, subsmooth, and merely closed sets. Finally, we briefly discuss some efficient numerical methods for obtaining approximate projections. Our results recover classical existence results in the literature and provide new insights into the numerical simulation of sweeping processes.