Pages that link to "Item:Q5210512"
From MaRDI portal
The following pages link to Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems (Q5210512):
Displaying 11 items.
- Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems (Q2052391) (← links)
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems (Q2079693) (← links)
- Newton-type optimal thresholding algorithms for sparse optimization problems (Q2676159) (← links)
- Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms (Q6041666) (← links)
- Heuristics for Finding Sparse Solutions of Linear Inequalities (Q6053490) (← links)
- Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems (Q6134435) (← links)
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery (Q6137779) (← links)
- Scaled proximal gradient methods for sparse optimization problems (Q6184263) (← links)
- Non-negative sparse recovery via momentum-boosted adaptive thresholding algorithm (Q6629226) (← links)
- From theoretical guarantee to practical performance: selectable and optimal step-lengths for IHT and HTP algorithms in compressed sensing (Q6636480) (← links)
- Dynamic thresholding algorithm with memory for linear inverse problems (Q6659673) (← links)
