Sciweavers

Share
CDC
2010
IEEE

Explicit solutions for root optimization of a polynomial family

11 years 1 months ago
Explicit solutions for root optimization of a polynomial family
Abstract-- Given a family of real or complex monic polynomials of fixed degree with one fixed affine constraint on their coefficients, consider the problem of minimizing the root radius (largest modulus of the roots) or abscissa (largest real part of the roots). We give constructive methods for finding globally optimal solutions to these problems. In the real case, our methods are based on theorems that extend results in Raymond Chen's 1979 PhD thesis. In the complex case, our methods are based on theorems that are new, easier to state but harder to prove than in the real case. Examples are presented illustrating the results, including several fixed-order controller optimal design problems.
Vincent D. Blondel, Mert Gurbuzbalaban, Alexandre
Added 13 May 2011
Updated 13 May 2011
Type Journal
Year 2010
Where CDC
Authors Vincent D. Blondel, Mert Gurbuzbalaban, Alexandre Megretski, Michael L. Overton
Comments (0)
books