This paper addresses robust performance analysis problems of linear time-invariant (LTI) systems affected by real parametric uncertainties. These problems, known also as a special class of structured singular value computation problems, are inherently intractable (NP-hard problems). As such intensive research effort has been made to obtain computationally tractable and less conservative analysis conditions, where linear matrix inequality (LMI) plays an important. Nevertheless, since LMI-based conditions are expected to be conservative in general, it is often the case that we cannot conclude anything if the LMI at hand turns out to be infeasible. This motivates us to consider the dual of the LMI and examine the structure of the dual solution. By pursuing this direction, in this paper, we provide rank conditions on the dual solution matrix under which we can conclude that the underlying robust performance is never attained. In particular, a set of uncertain parameters that violates the specified performance can be computed. These results come from block-moment matrix structure of the dual variable, which is consistent with the recent results on polynomial optimization. This particular structure enables us to make good use of simultaneous diagonalizability property of commuting diagonalizable matrices so that the sound rank conditions for the exactness verification can be obtained.
|Number of pages||14|
|Journal||IEEE Transactions on Automatic Control|
|Publication status||Published - May 2009|