Exploiting Term Sparsity in Moment-SOS hierarchy for Dynamical Systems

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 from [20] 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.

[1]  Didier Henrion,et al.  Convex Computation of Extremal Invariant Measures of Nonlinear Dynamical Systems and Markov Processes , 2018, J. Nonlinear Sci..

[2]  J. E. Rubio,et al.  Generalized Curves and Extremal Points , 1975 .

[3]  Andrew Packard,et al.  Stability Region Analysis Using Polynomial and Composite Polynomial Lyapunov Functions and Sum-of-Squares Programming , 2008, IEEE Transactions on Automatic Control.

[4]  Richard B. Vinter,et al.  Relaxation of optimal control problems to equivalent convex programs , 1980 .

[5]  L. Rodman,et al.  Positive semidefinite matrices with a given sparsity pattern , 1988 .

[6]  Jie Wang,et al.  Exploiting Sparsity in Complex Polynomial Optimization , 2021, J. Optim. Theory Appl..

[7]  Jie Wang,et al.  TSSOS: A Moment-SOS hierarchy that exploits term sparsity , 2020 .

[8]  Richard B. Vinter,et al.  The Equivalence of Strong and Weak Formulations for Certain Problems in Optimal Control , 1978 .

[9]  Thorsten Theobald,et al.  Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization , 2011, Math. Oper. Res..

[10]  Emmanuel Trélat,et al.  Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations , 2007, SIAM J. Control. Optim..

[11]  Didier Henrion,et al.  Convex Computation of the Region of Attraction of Polynomial Control Systems , 2012, IEEE Transactions on Automatic Control.

[12]  Didier Henrion,et al.  Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems , 2017, SIAM J. Control. Optim..

[13]  WakiHayato,et al.  Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity , 2006 .

[14]  Jie Wang,et al.  SparseJSR: A Fast Algorithm to Compute Joint Spectral Radius via Sparse SOS Decompositions , 2020, 2021 American Control Conference (ACC).

[15]  Colin Neil Jones,et al.  Convex Computation of the Maximum Controlled Invariant Set For Polynomial Control Systems , 2013, SIAM J. Control. Optim..

[16]  Milan Korda,et al.  Converging outer approximations to global attractors using semidefinite programming , 2021, Autom..

[17]  Victor Magron,et al.  Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension , 2020, SIAM J. Optim..

[18]  Jie Wang,et al.  Exploiting term sparsity in noncommutative polynomial optimization , 2020, Computational Optimization and Applications.

[19]  Milan Korda,et al.  Sparse moment-sum-of-squares relaxations for nonlinear dynamical systems with guaranteed convergence , 2020, 2012.05572.

[20]  Giovanni Fantuzzi,et al.  Bounding Extreme Events in Nonlinear Dynamics Using Convex Optimization , 2019, SIAM J. Appl. Dyn. Syst..