A Caltech Library Service

Mixed µ upper bound computation

Beck, Carolyn and Doyle, John (1992) Mixed µ upper bound computation. In: Proceedings of the 31st IEEE Conference on Decision and Control. Vol.4. IEEE , Piscataway, NJ, pp. 3187-3192. ISBN 0-7803-0872-7.

[img] PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


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 µ.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Doyle, John0000-0002-1828-2486
Additional Information:© 1991 IEEE. We would like to thank Micheal Fan and Stephen Boyd for preprints of their papers and/or copies of software, as well as valuable discussions about the material in this paper. We would also like to thank Peter Young and Matt Newlin for lending their Matlab and µ expertise to this project. This work was supported by AFOSR, NSF, and Rockwell.
Funding AgencyGrant Number
Air Force Office of Scientific Research (AFOSR)UNSPECIFIED
Rockwell InternationalUNSPECIFIED
Record Number:CaltechAUTHORS:20190319-085951997
Persistent URL:
Official Citation:C. Beck and J. Doyle, "Mixed mu upper bound computation," [1992] Proceedings of the 31st IEEE Conference on Decision and Control, Tucson, AZ, USA, 1992, pp. 3187-3192 vol.4. doi: 10.1109/CDC.1992.371241
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:93955
Deposited By: Tony Diaz
Deposited On:19 Mar 2019 16:26
Last Modified:16 Nov 2021 17:01

Repository Staff Only: item control page