“…The optimization problem (18) has two main disadvantages namely (i) it is a non-convex optimization problem, and (ii) its constraints lie in the infinite-dimensional attack space. To resolve these disadvantages, we adopt S-procedure and dissipative system theory and revisit the optimization problem (18) in the theorem below. To begin with, given a sampled uncertainty δ i ∈ Ω, we define Σp,i (A cl,i , B cl,i , C p,i , D p,i ) and Σr,i (A cl,i , B cl,i , C r,i , D r,i ) with y p (δ i ) = y pi , y r (δ i ) = y ri and x(δ i ) = x i as the outputs and states of Σp,i and Σr,i correspondingly.…”