Convex invariant sets for discrete-time Lur’e systems

In this paper, a method to estimate the domain of attraction of a class of discrete-time Lur’e systems is presented. A new notion of invariance, denoted LNL -invariance, is introduced. An algorithm to determinate the largest LNL -invariant set for this class of systems is proposed. Moreover, it is proven that the LNL -invariant sets provided by this algorithm are polyhedral convex sets and constitute an estimation of the domain of attraction of the non-linear system. It is shown that any contractive set for the Lur’e system is contained in the LNL -invariant set obtained applying the results of this paper. Two illustrative examples are given.