Sweeping by a tame process
classification
🧮 math.OC
keywords
sweepingprocessabsolutelyadmitsanalogousbeyondboundedcontinuous
read the original abstract
We show that any semi-algebraic sweeping process admits piecewise absolutely continuous solutions, and any such bounded trajectory must have finite length. Analogous results hold more generally for sweeping processes definable in o-minimal structures. This extends previous work on (sub)gradient dynamical systems beyond monotone sweeping sets.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.