A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted _2, q-norm minimization and its complex extension

DOI10.1016/J.TCS.2024.114594MaRDI QIDQ6548958FDOQ6548958

Authors: Wenyu Hu, Huiying Huang, Rong Zhang, Jinhong Huang, Yun Yi 

Publication date: 3 June 2024

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

Recommendations

• Computing the nearest polynomial to multiple given polynomials with a given zero via \(l_{2,q}\)-norm minimization
• Efficient computation of the nearest polynomial by linearized alternating direction method
• 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

zbMATH Keywords

non-convexnearest polynomialcomplex coefficient\(\ell_{2, q}\)-norm

Mathematics Subject Classification ID

Nonlinear algebraic or transcendental equations (65Hxx)

Cites Work

• First-order methods in optimization
• Nearest multivariate system with given root multiplicities
• Computing the nearest singular univariate polynomials with given root multiplicities
• Title not available (Why is that?)
• Computing multiple roots of inexact polynomials
• The nearest polynomial with a given zero, and similar problems
• The nearest polynomial with a given zero, revisited
• A unified algorithm for mixed \(l_{2,p}\)-minimizations and its application in feature selection
• The nearest polynomial with a zero in a given domain
• Title not available (Why is that?)
• Root Neighborhoods of a Polynomial
• Smoothed Low Rank and Sparse Matrix Recovery by Iteratively Reweighted Least Squares Minimization
• A simple procedure for the exact stability robustness computation of polynomials with affine coefficient perturbations
• Efficient computation of the nearest polynomial by linearized alternating direction method
• Structured singular values and stability analysis of uncertain polynomials. II: A missing link
• A note on a nearest polynomial with a given root
• The nearest complex polynomial with a zero in a given complex domain
• Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions
• Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems
• Group sparse optimization via \(\ell_{p,q}\) regularization
• Robust subspace segmentation via nonconvex low rank representation
• 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
• 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
• Matrix completion with column outliers and sparse noise
• Subspace clustering via joint \(\ell_{1, 2}\) and \(\ell_{2, 1}\) norms

This page was built for publication: A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension

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