Explicit solutions for root optimization of a polynomial family
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 globall...
Main Authors: | Blondel, Vincent D., Gurbuzbalaban, Mert, Megretski, Alexandre, Overton, Michael L. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2012
|
Online Access: | http://hdl.handle.net/1721.1/73103 https://orcid.org/0000-0001-9088-0205 https://orcid.org/0000-0003-1563-800X |
Similar Items
-
Explicit Solutions for Root Optimization of a Polynomial Family With One Affine Constraint
by: Blondel, Vincent D., et al.
Published: (2014) -
Real-Time Realization of a Family of Optimal Infinite-Memory Non-Causal Systems
by: Tanovic, Omer, et al.
Published: (2021) -
Roots Of Polynomials
by: Khaw , Inn Seng
Published: (2007) -
Roots of polynomials and the derangement problem
by: Bary-Soroker, L, et al.
Published: (2018) -
Iterative methods for roots of polynomials
by: Mekwi, W
Published: (2001)