Eaton, JulieGrundel, SaraGürbüzbalaban, MertOverton, Michael L.Max-Planck-Institut für Dynamik Komplexer Technischer Systeme2025-05-292015https://epflicht.bibliothek.uni-halle.de/handle/123456789/3938870663704urn:nbn:de:gbv:3:2-646562483288Abstract: The root radius of a polynomial is the maximum of the moduli of its roots (zeros). We consider the following optimization problem: minimize the root radius over monic polynomials of degree n, with either real or complex coefficients, subject to k consistent affine constraints on the coefficients. We show that there always exists an optimal polynomial with at most k − 1 inactive roots, that is, whose modulus is strictly less than the optimal root radius. We illustrate our results using some examples arising in feedback control.1 Online-Ressource (14 Seiten = 0,4 MB) : Diagrammeenghttp://rightsstatements.org/vocab/InC/1.0/510Book