In this paper, we consider the problem of computing the maximal invariant set of linear systems with a class of nonlinear constraints that admit quadratic relaxations. With these quadratic relaxations, we are able to determine a sufficient condition on the maximal invariant set. Using the sufficient condition, a new algorithm is presented by solving a set of linear matrix inequalities. Under mild assumptions, the proposed algorithm will terminate in finite time. The performance of this algorithm is demonstrated on several numerical examples.
Wang, Z., Jungers, R., & Ong, C.-J. (2019). Computation of the maximal invariant set of linear systems with quasi-smooth nonlinear constraints. 2019 18th European Control Conference (ECC), p. 3803-3808. https://doi.org/10.23919/ecc.2019.8796145