Efficient computation of the nearest polynomial by linearized alternating direction method

DOI10.1016/j.amc.2020.125860OpenAlexW3111513760MaRDI QIDQ2663820

Jinhong Huang, Zhihui Tu, Wenyu Hu, Zichang Zhang, Duanmei Zhou

Publication date: 20 April 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2020.125860

zbMATH Keywords

real zeronearest polynomialempirical polynomiallinearized alternating direction method\( \ell_{p,q}\) norm

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Real polynomials: analytic properties, etc. (26C05) Numerical approximation and computational geometry (primarily algorithms) (65D99)

Cites Work

• Unnamed Item
• 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
• Structured singular values and stability analysis of uncertain polynomials. II: A missing link
• Fast projections onto mixed-norm balls with applications
• An efficient and globally convergent algorithm for \(\ell_{p,q} - \ell_r\) model in group sparse optimization
• The nearest polynomial to multiple given polynomials with a given zero: a unified optimization approach
• 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
• The nearest polynomial with a zero in a given domain
• The nearest polynomial to multiple given polynomials with a given zero
• Root Neighborhoods of a Polynomial
• First-Order Methods in Optimization
• The nearest polynomial with a given zero, and similar problems
• A note on a nearest polynomial with a given root
• The nearest polynomial with a given zero, revisited

This page was built for publication: Efficient computation of the nearest polynomial by linearized alternating direction method