Pages that link to "Item:Q2663820"

The following pages link to Efficient computation of the nearest polynomial by linearized alternating direction method (Q2663820):

Displaying 7 items.

• The \(L^{2}\)-optimality of the IIPG method for odd degrees of polynomial approximation in 1D (Q618557) (← links)
• Efficient implementation of minimal polynomial and reduced rank extrapolation methods (Q1182666) (← links)
• 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)
• A unified approach to computing the nearest complex polynomial with a given zero (Q2354766) (← links)
• (Q6075957) (← 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)