Convergence order of a numerical scheme for sweeping process
From MaRDI portal
Abstract: In a previous paper, an implementable algorithm was introduced to compute discrete solutions of sweeping processes (i.e. specific first order differential inclusions). The convergence of this numerical scheme was proved thanks to compactness arguments. Here we establish that this algorithm is of order 1/2 . The considered sweeping process involves a set-valued map given by a finite number of inequality constraints. The proof rests on a metric qualification condition between the sets associated to each constraint.
Recommendations
- A numerical scheme for a class of sweeping processes
- On semicoercive sweeping process with velocity constraint
- Sweeping processes and rate independence
- Stochastic perturbation of sweeping process and a convergence result for an associated numerical scheme
- Optimal control with sweeping processes: numerical method
Cited in
(5)- Existence and Lyapunov pairs for the perturbed sweeping process governed by a fixed set
- Sweeping process by prox-regular sets in Riemannian Hilbert manifolds
- Convergence order of implicit Euler numerical scheme for maximal monotone differential inclusions
- A numerical scheme for a class of sweeping processes
- Inexact catching-up algorithm for Moreau's sweeping processes
This page was built for publication: Convergence order of a numerical scheme for sweeping process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2862459)