Inexact catching-up algorithm for Moreau's sweeping processes

From MaRDI portal





In this work, an inexact version of the catching-up algorithm for sweeping processes is given. More precisely, the authors introduce a notion of approximate projection, which is compatible with any numerical method for approximating exact projections and provide several properties of the new approximate projections. Based on these properties the convergence of the inexact catching-up algorithm (in three general frameworks: prox-regular moving sets, subsmooth moving sets, and merely closed sets) is proved. Then, as application, the authors use the numerical method for treating complementarity dynamical systems.



Cites work









This page was built for publication: Inexact catching-up algorithm for Moreau's sweeping processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6917704)