Pages that link to "Item:Q2354766"
From MaRDI portal
The following pages link to A unified approach to computing the nearest complex polynomial with a given zero (Q2354766):
Displaying 4 items.
- The nearest polynomial to multiple given polynomials with a given zero: a unified optimization approach (Q1985438) (← links)
- Computing the nearest polynomial to multiple given polynomials with a given zero via \(l_{2,q}\)-norm minimization (Q2290644) (← links)
- Efficient computation of the nearest polynomial by linearized alternating direction method (Q2663820) (← links)
- A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension (Q6548958) (← links)
