Sweeping by a tame process
Optimization and Control
2016-11-29 v2
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.
Cite
@article{arxiv.1412.8581,
title = {Sweeping by a tame process},
author = {Aris Daniilidis and Dmitriy Drusvyatskiy},
journal= {arXiv preprint arXiv:1412.8581},
year = {2016}
}
Comments
18 pages