LMIs in Control/Bounded Real Lemma

From Wikibooks, open books for an open world
Jump to navigation Jump to search

LMIs in Control/Bounded Real Lemma


The System:


The Optimization Problem: Given a state space system of

with A being stable and A, B,C and D and (A,B,C) being minimal there exists a P=P^T that can be used to solve the bounded real lemma problem using the LMI mentioned below.

The LMI: The Bounded Real Lemma

The LMI is feasible if and only if the state space is non expansive. < for all solutions of the state space with x(0) = 0, This condition can also be expressed in terms of the transfer matrix H. Nonexpansivity is equivalent to the transfer matrix H satisfying the bounded-real condition, for all


Conclusion:

The LMI is feasible, if and only if the Hamiltonian Matrix M has no imaginary eigenvalues.


Related LMIs:

1. KYP Lemma. https://en.wikibooks.org/wiki/LMIs_in_Control/KYP_Lemmas/KYP_Lemma_(Bounded_Real_Lemma)

Implementation[edit | edit source]

A link to CodeOcean or other online implementation of the LMI (in progress)

References[edit | edit source]

1. Linear Matrix Inequalities in System and Control Theory by Stephen Boyd, Laurent El Ghaoui, Eric Feron, and Venkataramanan Balakrishnan Section 2.7.3
* LMIs in Systems and Control Theory