Outer approximation algorithms for KYP-based LMIs

The performance of an outer approximation approximation algorithm for a class of linear matrix inequalities (LMIs) derived from the Kalman-Yakubovich-Popov lemma is analyzed. It is shown that for a specific class of control motivated problems, the optimal solution is achieved in a finite number of i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148) Jg. 4; S. 3025 - 3028 vol.4
1. Verfasser: Parrilo, P.A.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 2001
Schlagworte:
ISBN:9780780364950, 0780364953
ISSN:0743-1619
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The performance of an outer approximation approximation algorithm for a class of linear matrix inequalities (LMIs) derived from the Kalman-Yakubovich-Popov lemma is analyzed. It is shown that for a specific class of control motivated problems, the optimal solution is achieved in a finite number of iterations. Possible modifications for improving performance are discussed.
ISBN:9780780364950
0780364953
ISSN:0743-1619
DOI:10.1109/ACC.2001.946378