NUMERICAL ALGORITHMS FOR THE LARGEST STRUCTURED SINGULAR VALUE OF A $\mu$–SYNTHESIS CONTROL SYSTEM

Optimizing the Rayleigh quotient with symmetric constraints and its application to perturbations of structured polynomial eigenvalue problems

“…The computational complexity of computing SSV depends on the perturbation class S, and it can vary from trivial to NP-hard for various structured classes [6]. For such classes, many polynomial time algorithms have been developed to estimate SSV; see [17,7,18,11]. Doyle first introduced SSV in [8] for block diagonal complex structured uncertainties and was later studied for block diagonal real or complex or mixed real/complex uncertainties; see [17,9,16,18] and references therein.…”