Linear Matrix Inequalities in Control
Linear Matrix Inequalities in Control
Linear Matrix Inequalities in Control
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
From truss topology design to LMI’s<br />
First elim<strong>in</strong>ate aff<strong>in</strong>e equality constra<strong>in</strong>t A(s)d = f:<br />
m<strong>in</strong>imize f ⊤ (A(s)) −1 f<br />
subject to A(s) ≻ 0, ℓ ⊤ s ≤ v, a ≤ s ≤ b<br />
Push objective to constra<strong>in</strong>ts with auxiliary variable γ:<br />
m<strong>in</strong>imize γ<br />
subject to γ > f ⊤ (A(s)) −1 f, A(s) ≻ 0, ℓ ⊤ s ≤ v, a ≤ s ≤ b<br />
Apply Schur lemma to l<strong>in</strong>earize<br />
m<strong>in</strong>imize γ<br />
<br />
γ f ⊤<br />
subject to<br />
≻ 0, ℓ<br />
f A(s)<br />
⊤s ≤ v, a ≤ s ≤ b<br />
Note that the latter is an LMI optimization problem as all constra<strong>in</strong>ts on s<br />
are formulated as LMI’s!!<br />
Siep Weiland and Carsten Scherer (DISC) <strong>L<strong>in</strong>ear</strong> <strong>Matrix</strong> <strong>Inequalities</strong> <strong>in</strong> <strong>Control</strong> Class 1 55 / 59