Exploiting Term Sparsity in Moment-SOS Hierarchy for Dynamical Systems
From MaRDI portal
(Redirected from Exploiting Term Sparsity in Moment-SOS Hierarchy for Dynamical Systems)
Abstract: In this paper we present term sparsity sum-of-squares (TSSOS) methods applied to several problems from dynamical systems, such as region of attraction, maximum positively invariant sets and global attractors. We combine the TSSOS algorithm of Wang, Magron and Lasserre [SIAM J. Optim., 31(1):30-58, 2021] with existing infinite dimensional linear program representations of those sets. This leads to iterative schemes in the moment-sum-of-squares hierarchy which allows less expensive computations while keeping convergence guarantees. Finally this procedure is closely related to sign symmetries of the dynamical system as was already revealed for polynomial optimization. Numerical examples demonstrate the efficiency of the approach in the presence of appropriate sparsity.
Cited in
(5)- On symmetry adapted bases in trigonometric optimization
- Symmetry reduction and recovery of trajectories of optimal control problems via measure relaxations
- Towards optimal spatio-temporal decomposition of control-related sum-of-squares programs
- Sparse polynomial optimization with unbounded sets
- Sparse decompositions of nonlinear dynamical systems and applications to moment-sum-of-squares relaxations
This page was built for publication: Exploiting Term Sparsity in Moment-SOS Hierarchy for Dynamical Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6200025)