Cited in
(22)- Constructing Test Instances for Basis Pursuit Denoising
- Computing and analyzing recoverable supports for sparse reconstruction
- A cyclic projected gradient method
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- Fast L1-L2 minimization via a proximal operator
- New strong convergence method for the sum of two maximal monotone operators
- Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing
- BLOOMP
- ParNes
- SPGL1
- l1_ls
- FPC
- IMRO
- PNOPT
- SpaRSA
- Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems
- Minimization of \(L_1\) over \(L_2\) for sparse signal recovery with convergence guarantee
- Solving basis pursuit: heuristic optimality check and solver comparison
- Efficient evaluation of scaled proximal operators
- Homogeneous penalizers and constraints in convex image restoration
- Templates for convex cone problems with applications to sparse signal recovery
- IMRO: A proximal quasi-Newton method for solving \(\ell_1\)-regularized least squares problems
This page was built for software: L1TestPack
