Title :
A lower bound for the mixed μ problem
Author :
Young, Peter M. ; Doyle, John C.
Author_Institution :
Dept. of Electr. Eng., Colorado State Univ., Fort Collins, CO, USA
fDate :
1/1/1997 12:00:00 AM
Abstract :
The mixed μ problem has been shown to be NP hard so that exact analysis appears intractable. Our goal then is to exploit the problem structure so as to develop a polynomial time algorithm that approximates μ and usually gives good answers. To this end it is shown that μ is equivalent to a real eigenvalue maximization problem, and a power algorithm is developed to tackle this problem. The algorithm not only provides a lower bound for μ but has the property that μ is (almost) always an equilibrium point of the algorithm
Keywords :
computational complexity; control system analysis; matrix algebra; optimisation; robust control; NP hard; eigenvalue maximization problem; equilibrium point; lower bound; mixed μ problem; polynomial time algorithm; power algorithm; Eigenvalues and eigenfunctions; H infinity control; Robustness; Uncertainty;
Journal_Title :
Automatic Control, IEEE Transactions on
