LMIs in Control/Matrix and LMI Properties and Tools/Dualization Lemma

From testwiki
Jump to navigation Jump to search

Dualization Lemma

Consider PiSn and the subspaces U,V, where P is invertible and U+V=Rn. The following are equivalent.

XTPX<0 for all XU\{0} and XTPX0 for all XV.

XTP1X>0 for all XU\{0} and XTP1X0 for all XV.

Example

Consider the matrices QSn,SRn×m,RSm,MRm×n where R0, which define the quadratic matrix inequality

[1M][QSSTR][1M]<0.(1)

Define P=[QSSTR],U=R([01]) where U+V=Rn+m. Notice that (1) is equivalent to XTPX<0 for all XU\{0}.Additionally, XTPX<0 for all XV is euaivalent to

[01][QSSTR][01]=R0,

which is satisfied based on the definition of R . By the dualization lemma, (1) is satisfied with R0 if and only if

[MT1][Q~S~S~TR~][MT1]>0,Q~0,

where [Q~S~S~TR~]=[QSSTR]1,U=N([1MT])=R([MT1]) , and V=N([01])=R([10]).

Template:BookCat