swMATH14267MaRDI QIDQ26172FDOQ26172
Author name not available (Why is that?)
Official website: http://web.stanford.edu/~boyd/l1_ls/
Cited In (17)
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
- Kernel methods and haplotypes used in selection of sparse DNA markers for protein yield in dairy cattle
- Exponential screening and optimal rates of sparse estimation
- Manifold adaptive kernelized low-rank representation for semisupervised image classification
- Enhanced low-rank representation via sparse manifold adaption for semi-supervised learning
- The non-convex sparse problem with nonnegative constraint for signal reconstruction
- ALPO
- Plus
- FPC
- PNOPT
- SpaRSA
- ADMM
- CGIST
- Approximate submodularity and its applications: subset selection, sparse approximation and dictionary selection
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
- IMRO: A proximal quasi-Newton method for solving \(\ell_1\)-regularized least squares problems
- Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions
This page was built for software: l1_ls
