TY - GEN
T1 - A gain-based lower bound algorithm for real and mixed μ problems
AU - Seiler, Pete
AU - Balas, Gary
AU - Packard, Andrew
PY - 2006
Y1 - 2006
N2 - In this paper we present a new lower bound algorithm for real and mixed μ problems. The basic idea of this algorithm is to use a related worst-case gain problem to compute the real blocks and, if the block structure is mixed, the standard power iteration to compute the complex blocks. Initial numerical tests indicate that the algorithm is fast and provides good bounds for both real and mixed μ problems of small to moderate size.
AB - In this paper we present a new lower bound algorithm for real and mixed μ problems. The basic idea of this algorithm is to use a related worst-case gain problem to compute the real blocks and, if the block structure is mixed, the standard power iteration to compute the complex blocks. Initial numerical tests indicate that the algorithm is fast and provides good bounds for both real and mixed μ problems of small to moderate size.
UR - http://www.scopus.com/inward/record.url?scp=39649088943&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=39649088943&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:39649088943
SN - 1424401712
SN - 9781424401710
T3 - Proceedings of the IEEE Conference on Decision and Control
SP - 3548
EP - 3553
BT - Proceedings of the 45th IEEE Conference on Decision and Control 2006, CDC
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 45th IEEE Conference on Decision and Control 2006, CDC
Y2 - 13 December 2006 through 15 December 2006
ER -