Computational complexity in robust controller synthesis

Authors
Citation
S. Hara et Y. Yamada, Computational complexity in robust controller synthesis, LECT N CONT, 241, 1999, pp. 59-80
Citations number
27
Categorie Soggetti
Current Book Contents
ISSN journal
01708643
Volume
241
Year of publication
1999
Pages
59 - 80
Database
ISI
SICI code
0170-8643(1999)241:<59:CCIRCS>2.0.ZU;2-7
Abstract
This paper is concerned with the computational complexity analysis in robus t control problems. We first formulate a fairly general class of nonconvex optimization problem named "Matrix Product Eigenvalue Problem (MPEP)" and e xplain the connection to robust control problems. We next summarize the wor st case computational complexity results and investigate the computational cost for the actual case. Finally, we make a comparison with an element-wis e bounding for the BMI optimization problem and a matrix-based bounding for the MPEP.