Mixed mu problems and branch and bound techniques
Matthew P. Newlin, Peter Michael Young · 2005
The computation of the general structural singular value ( mu ) is NP hard. Therefore, quick solutions to medium sized problems must often be approximate. In many of the cases where the current approximate methods are unsatisfactory, improved solutions can be obtained. It is shown that, despite its combinatoric nature, branch and bound techniques can give substantially improved solutions with only moderate computational cost.>