The nearest polynomial to multiple given polynomials with a given zero: a unified optimization approach

DOI10.1016/j.aml.2020.106345zbMath1436.90153OpenAlexW3011590898MaRDI QIDQ1985438

Zhihui Tu, Wenyu Hu, Gaohang Yu

Publication date: 7 April 2020

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2020.106345

zbMATH Keywords

optimizationzeronearest polynomial\(\ell_{rempirical polynomials}\)-norm

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47)

Related Items

Efficient computation of the nearest polynomial by linearized alternating direction method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A simple procedure for the exact stability robustness computation of polynomials with affine coefficient perturbations
• The nearest complex polynomial with a zero in a given complex domain
• Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Structured singular values and stability analysis of uncertain polynomials. II: A missing link
• On the condition of algebraic equations
• Computing the nearest polynomial to multiple given polynomials with a given zero via \(l_{2,q}\)-norm minimization
• An efficient primal dual prox method for non-smooth optimization
• A unified approach to computing the nearest complex polynomial with a given zero
• The nearest polynomial to multiple given polynomials with a given zero in the real case
• Root Neighborhoods of a Polynomial