Computing the nearest polynomial to multiple given polynomials with a given zero via l₂,q-norm minimization

DOI10.1016/J.TCS.2019.12.034MaRDI QIDQ2290644zbMATH OpenOpenAlexWikidataFDO

Authors Wenyu Hu, Shenghao Li, Jinhong Huang, Tinghua Wang, Gaohang Yu

Publication date 29 January 2020

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2019.12.034

zbMATH Keywords

\(l_{p,q}\)-norm minimizationmatrix normnearest polynomialzero

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10)

Recommendations

• The nearest polynomial to multiple given polynomials with a given zero: a unified optimization approach
• The nearest polynomial to multiple given polynomials with a given zero in the real case
• Efficient computation of the nearest polynomial by linearized alternating direction method
• A unified approach to computing the nearest complex polynomial with a given zero
• The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval

Cites work

• A note on a nearest polynomial with a given root
• A simple procedure for the exact stability robustness computation of polynomials with affine coefficient perturbations
• A unified algorithm for mixed \(l_{2,p}\)-minimizations and its application in feature selection
• A unified approach to computing the nearest complex polynomial with a given zero
• Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions
• Group sparse optimization via \(\ell_{p,q}\) regularization
• scientific article; zbMATH DE number 2125604 (Why is no real title available?)
• scientific article; zbMATH DE number 1262454 (Why is no real title available?)
• Robust alternating low-rank representation by joint \(L_p\)- and \(L_{2,p}\)-norm minimization
• The nearest complex polynomial with a zero in a given complex domain
• The nearest polynomial to multiple given polynomials with a given zero
• The nearest polynomial with a given zero, and similar problems
• The nearest polynomial with a given zero, revisited
• The nearest polynomial with a zero in a given domain

Cited in

(8)

• The nearest polynomial to multiple given polynomials with a given zero: a unified optimization approach
• 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
• Efficient computation of the nearest polynomial by linearized alternating direction method
• The nearest polynomial to multiple given polynomials with a given zero
• scientific article; zbMATH DE number 1262454 (Why is no real title available?)
• Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions
• A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension

This page was built for publication: Computing the nearest polynomial to multiple given polynomials with a given zero via \(l_{2,q}\)-norm minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290644)