no. 10 · Friday 6 November 2026
Convergence and Stability of a Catching-Up Algorithm for Differential Inclusions with Maximally Monotone Operators
Abstract
We study a catching-up algorithm with approximate projections for finite-dimensional differential inclusions governed by a maximally monotone operator and a continuous perturbation. Through the canonical decomposition of the operator into a regular part and the normal cone to the closure of its domain, the problem becomes a sweeping process, discretized by an explicit predictor step and a feasible approximate projection. For variable time steps, the approximations converge, up to a subsequence, to a solution on every finite horizon when the mesh size and the accumulated projection-error budget vanish and the nodes stay in a common compact convex set. This set comes from linear growth on finite horizons and, without any growth condition, by dissipativity of the projected field at a feasible center, which confines the nodes to a fixed ball uniformly in time for small steps and small projection errors. Under either condition, locally Lipschitz perturbations give global well-posedness, convergence of the whole family, and, for a common initial state, a trajectory-error estimate of order $O(\sqrt{h+E})$, where $h$ is the maximal step and $E$ the accumulated budget; sparse projection errors are allowed. An elastic network with unilateral stops illustrates the results, and numerical experiments compare the algorithm with the full-resolvent discretization.
- fields
- Optimization and Control