Optimization Online


Explicit Solutions for Root Optimization of a Polynomial Family with One Affine Constraint

Vincent D. Blondel(blondel***at***mit.edu)
Mert Gurbuzbalaban(mert***at***courant.nyu.edu)
Alexander Megretski(ameg***at***mit.edu)
Michael L. Overton(overton***at***cs.nyu.edu)

Abstract: 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.

Keywords: root optimization, fixed-order controller design, optimizing root abscissa and radius, minimum order controller design problem, feedback stabilization

Category 1: Convex and Nonsmooth Optimization (Nonsmooth Optimization )

Category 2: Global Optimization

Category 3: Applications -- Science and Engineering (Control Applications )

Citation: Submitted revised version.

Download: [PDF]

Entry Submitted: 04/22/2011
Entry Accepted: 04/22/2011
Entry Last Modified: 04/22/2011

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society