Pages that link to "Item:Q259117"
From MaRDI portal
The following pages link to A note on the complexity of proximal iterative hard thresholding algorithm (Q259117):
Displaying 4 items.
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming (Q463721) (← links)
- Mean squared error bounds for the Rangan-Goyal soft thresholding algorithm (Q711045) (← links)
- A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery (Q827377) (← links)
- A new proximal iterative hard thresholding method with extrapolation for \(\ell _0\) minimization (Q2311987) (← links)