Polynomial root radius optimization with affine constraints (Q1675252): Difference between revisions

The problem of minimizing the root radius over monic polynomials of degree \(n\) with either real or complex coefficients, subject to \(k\) linearly independent affine constraints on the coefficients is investigated. The main result states that there always exists an optimal polynomial with at most \(k-1\) roots whose moduli are strictly less than the optimal root radius, so-called inactive roots and its (quite involved) proof is divided into several steps, some of which interesting also per se. Illustrative examples arising in feedback control and some interesting ideas for future work complete the paper.