A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension
type: Item
instance of: scholarly article
title: A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension
author: Wenyu Hu
author: Huiying Huang
author: Rong Zhang
author: Jinhong Huang
author: Yun Yi
published in: Theoretical Computer Science
publication date: 2024-06-03T00:00:00Z
Mathematics Subject Classification ID: 65Hxx
zbMATH DE Number: 7858795
zbMATH Keywords: nearest polynomial
zbMATH Keywords: \(\ell_{2, q}\)-norm
zbMATH Keywords: non-convex
zbMATH Keywords: complex coefficient
MaRDI profile type: MaRDI publication profile
cites work: Q3156429
cites work: A simple procedure for the exact stability robustness computation of polynomials with affine coefficient perturbations
cites work: Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems
cites work: Structured singular values and stability analysis of uncertain polynomials. II: A missing link
cites work: Root Neighborhoods of a Polynomial
cites work: Computing multiple roots of inexact polynomials
cites work: Q4232504
cites work: Computing the nearest singular univariate polynomials with given root multiplicities
cites work: The nearest polynomial with a given zero, and similar problems
cites work: A note on a nearest polynomial with a given root
cites work: The nearest complex polynomial with a zero in a given complex domain
cites work: Nearest multivariate system with given root multiplicities
cites work: The nearest polynomial with a given zero, revisited
cites work: A unified approach to computing the nearest complex polynomial with a given zero
cites work: The nearest polynomial with a zero in a given domain
cites work: Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions
cites work: The nearest polynomial to multiple given polynomials with a given zero in the real case
cites work: The nearest polynomial to multiple given polynomials with a given zero: a unified optimization approach
cites work: Efficient computation of the nearest polynomial by linearized alternating direction method
cites work: Computing the nearest polynomial to multiple given polynomials with a given zero via \(l_{2,q}\)-norm minimization
cites work: Smoothed Low Rank and Sparse Matrix Recovery by Iteratively Reweighted Least Squares Minimization
cites work: Group sparse optimization via $\ell_{p,q}$ regularization
cites work: A unified algorithm for mixed \(l_{2,p}\)-minimizations and its application in feature selection
cites work: Matrix completion with column outliers and sparse noise
cites work: Robust subspace segmentation via nonconvex low rank representation
cites work: Subspace clustering via joint \(\ell_{1, 2}\) and \(\ell_{2, 1}\) norms
cites work: First-Order Methods in Optimization
DOI: 10.1016/J.TCS.2024.114594
description: scientific article; zbMATH DE number 7858795