A dynamic working set method for compressed sensing
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 7306914 (Why is no real title available?)
- A coordinate gradient descent method for nonsmooth separable minimization
- A simple proof of the restricted isometry property for random matrices
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Compressed sensing
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Nonlinear optimization.
- On Sparse Representations in Arbitrary Redundant Bases
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Scikit-learn: machine learning in Python
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
This page was built for publication: A dynamic working set method for compressed sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866537)
