Jump to content

LMIs in Control/Matrix and LMI Properties and Tools/Variable Reduction Lemma

From Wikibooks, open books for an open world

Introduction

[edit | edit source]

The variable reduction lemma allows the solution of algebraic Riccati inequality that involve a matrix of unknown dimension. This often arises when finding the controller that minimizes the H norm.

The Data

[edit | edit source]

In order to find the unknown matrix we need matrices , & .

The Optimization Problem

[edit | edit source]

Given a symmetric matrix and two matrices & of column dimension n, consider the problem of finding matrix of compatible dimensions such that

The above equation is solvable for some if and only if the following two conditions hold

Where and are matrices whose columns are bases for the null spaces of & , respectively.

Implementation

[edit | edit source]

This can be implemented in any LMI solver such as YALMIP, using an algorithmic solver like Gurobi.

Conclusion

[edit | edit source]

Using this technique we can get the value of unknown matrix .

[edit | edit source]

A list of references documenting and validating the LMI.


Return to Main Page

[edit | edit source]

https://en.wikibooks.org/wiki/LMIs_in_Control