DocumentCode
2407722
Title
Mixed μ upper bound computation
Author
Beck, Carolyn ; Doyle, John
Author_Institution
Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA
fYear
1992
fDate
1992
Firstpage
3187
Abstract
Computation of the mixed real and complex μ upper bound expressed in terms of linear matrix inequalities (LMIs) is considered. Two existing methods are used, the Osborne (1960) method for balancing matrices, and the method of centers as proposed by Boyd and El Ghaoui (1991). These methods are compared, and a hybrid algorithm that combines the best features of each is proposed. Numerical experiments suggest that this hybrid algorithm provides an efficient method to compute the upper bound for mixed μ
Keywords
matrix algebra; minimisation; linear matrix inequalities; mixed mu upper bound; numerical experiments; Eigenvalues and eigenfunctions; Linear matrix inequalities; Optimization methods; Symmetric matrices; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 1992., Proceedings of the 31st IEEE Conference on
Conference_Location
Tucson, AZ
Print_ISBN
0-7803-0872-7
Type
conf
DOI
10.1109/CDC.1992.371241
Filename
371241
Link To Document