Pages that link to "Item:Q3096890"
From MaRDI portal
The following pages link to Concave programming for finding sparse solutions to problems with convex constraints (Q3096890):
Displayed 6 items.
- Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems (Q2052391) (← links)
- A smoothing method for sparse optimization over convex sets (Q2191281) (← links)
- Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method (Q2257078) (← links)
- DC Approximation Approach for ℓ0-minimization in Compressed Sensing (Q2808067) (← links)
- Constructing New Weighted <i>ℓ</i><sub>1</sub>-Algorithms for the Sparsest Points of Polyhedral Sets (Q2976140) (← links)
- Sparse approximation over the cube (Q6085987) (← links)