Explicit Solutions for Root Optimization of a Polynomial Family With One Affine Constraint
Author(s)Blondel, Vincent D.; Gurbuzbalaban, Mert; Megretski, Alexandre; Overton, Michael L.
MetadataShow full item record
Given a family of real or complex monic polynomials of fixed degree with one affine constraint on their coefficients, consider the problem of minimizing the root radius (largest modulus of the roots) or root abscissa (largest real part of the roots). We give constructive methods for efficiently computing the globally optimal value as well as an optimal polynomial when the optimal value is attained and an approximation when it is not. An optimal polynomial can always be chosen to have at most two distinct roots in the real case and just one distinct root in the complex case. Examples are presented illustrating the results, including several fixed-order controller optimal design problems.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
IEEE Transactions on Automatic Control
Institute of Electrical and Electronics Engineers (IEEE)
Blondel, V. D., M. Gurbuzbalaban, A. Megretski, and M. L. Overton. “Explicit Solutions for Root Optimization of a Polynomial Family With One Affine Constraint.” IEEE Trans. Automat. Contr. 57, no. 12 (December 2012): 3078–3089.