Jump to content

LMIs in Control/Click here to continue/Fundamentals of Matrix and LMIs/Finsler’s Lemma

From Wikibooks, open books for an open world

LMIs in Control/Matrix and LMI Properties and Tools/Finsler's Lemma


This method It states equivalent ways to express the positive definiteness of a quadratic form Q constrained by a linear form L. It is equivalent to other lemmas used in optimization and control theory, such as Yakubovich's S-lemma, Finsler's lemma and it is wedely used in Linear Matrix Inequalities


Theorem

[edit | edit source]

Consider Ψ∈𝕊n,G∈ℝn×m,H∈ℝn×p. There exists A∈ℝm×p such that

Ψ+GAHT+HATGT<0,

if and only if there exists σ∈ℝ such that

Ψ−σGGT<0

Ψ−σHHT<0

Alternative Forms of Finsler's Lemma

[edit | edit source]

Consider Ψ∈𝕊n,Z∈ℝp×n,x∈ℝnand σ∈ℝ>0. If there exists Z such that

xTΨx,0


holds for all x ≠ 0 satisfying Zx=0, then there exists σ such that

Ψ−σZTZ<0

Modified Finsler's Lemma

[edit | edit source]

Consider Ψ∈𝕊n,G∈ℝn×m,A∈ℝm×p,H∈ℝn×pand ϵ∈ℝ>0, where ATA is less that on equal to ℝ, and R>0. There exists A such that

Ψ+GAHT+HATGTT<0,

there exists ϵ such that

Ψ+ϵ−1GGT+ϵHRHT<0.

Conclusion

[edit | edit source]

In summary, a number of identical methods have been stated above to determine the positive definiteness of LMIs.


[edit | edit source]

A list of references documenting and validating the LMI.


Return to Main Page:

[edit | edit source]