Premium
MIXED μ PROBLEMS AND BRANCH AND BOUND TECHNIQUES
Author(s) -
Newlin Matthew P.,
Young Peter M.
Publication year - 1997
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/(sici)1099-1239(199702)7:2<145::aid-rnc302>3.0.co;2-n
Subject(s) - branch and bound , computer science , mathematical optimization , mathematics
The computation of the general structural singular value (μ) is NP hard, so quick solutions to medium sized problems must often be approximate. In many of the cases where the current approximate methods are unsatisfactory, improved solutions are highly desirable. It is shown that, despite their worst‐case combinatorial nature, branch and bound techniques can give substantially improved solutions with only moderate computational cost. © 1997 by John Wiley & Sons, Ltd.