MIXED μ PROBLEMS AND BRANCH AND BOUND TECHNIQUES

Matthew P. Newlin, Peter Michael Young · International Journal of Robust and Nonlinear Control · 1997

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.

Read the paper · More papers on PaperTik