A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension (Q6548958)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted _2, q-norm minimization and its complex extension |
scientific article; zbMATH DE number 7858795
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension |
scientific article; zbMATH DE number 7858795 |
Statements
A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension (English)
0 references
3 June 2024
0 references
nearest polynomial
0 references
\(\ell_{2, q}\)-norm
0 references
non-convex
0 references
complex coefficient
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8927344083786011
0 references
0.8609430193901062
0 references
0.8481574654579163
0 references
0.8377582430839539
0 references
0.8241804242134094
0 references
