Explicit solutions for root optimization of a polynomial family

Vincent D. Blondel; Mert Gürbüzbalaban; Alexandre Megretski; Michael L. Overton

doi:10.1109/CDC.2010.5718074

Conference paper, 2010

Explicit solutions for root optimization of a polynomial family

Vincent D. Blondel, Mert Gürbüzbalaban, Alexandre Megretski, Michael L. Overton

IEEE Conference on Decision and Control (CDC), pp. 485–488, 2010.

Publisher (DOI)

In brief

The conference version of the root-optimization result: for monic polynomials with one affine constraint on the coefficients, the polynomial with the smallest root radius has a single repeated root, which can be computed explicitly.

Topics

Spectral & nonsmooth optimization

Cite

@inproceedings{blondel2010root,
  title   = {Explicit solutions for root optimization of a polynomial family},
  author  = {Vincent D. Blondel and Mert Gürbüzbalaban and Alexandre Megretski and Michael L. Overton},
  year    = {2010},
  booktitle = {IEEE Conference on Decision and Control (CDC)},
  pages   = {485--488},
  doi     = {10.1109/CDC.2010.5718074},
}