Title :
Advances in the computation of the μ lower bound
Author :
Newlin, Matthew P. ; Glavaski, Sonja T.
Author_Institution :
Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA
Abstract :
Although the mixed μ problem is NP hard and exact general computation is futile, computation of bounds is reasonable and useful. This paper presents a new scheme for lower bound computation for the mixed μ problem. Extensive tests on particularly difficult problems show that this new scheme is a substantial improvement over previous algorithms
Keywords :
computational complexity; control system analysis; convergence of numerical methods; eigenvalues and eigenfunctions; iterative methods; robust control; μ-lower bound; NP hard problem; convergence; eigenvectors; iterative method; lower bound; mixed μ problem; robust control; Approximation algorithms; Computational complexity; Convergence; Eigenvalues and eigenfunctions; Heuristic algorithms; NP-hard problem; Polynomials; Rail to rail inputs; Uncertainty;
Conference_Titel :
American Control Conference, Proceedings of the 1995
Conference_Location :
Seattle, WA
Print_ISBN :
0-7803-2445-5
DOI :
10.1109/ACC.1995.529286
