Pages that link to "Item:Q2976140"
From MaRDI portal
The following pages link to Constructing New Weighted <i>ℓ</i><sub>1</sub>-Algorithms for the Sparsest Points of Polyhedral Sets (Q2976140):
Displaying 8 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)
- A smoothing method for sparse optimization over convex sets (Q2191281) (← links)
- Newton-type optimal thresholding algorithms for sparse optimization problems (Q2676159) (← links)
- Heuristics for Finding Sparse Solutions of Linear Inequalities (Q6053490) (← links)
- Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems (Q6134435) (← links)
- Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming (Q6173941) (← links)
- Scaled proximal gradient methods for sparse optimization problems (Q6184263) (← links)
