The Moreau envelope based efficient first-order methods for sparse recovery
From MaRDI portal
Publication:2628357
DOI10.1016/j.cam.2017.03.014zbMath1383.94006OpenAlexW2605014462MaRDI QIDQ2628357
Publication date: 1 June 2017
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2017.03.014
Numerical mathematical programming methods (65K05) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Uses Software
Cites Work
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Templates for convex cone problems with applications to sparse signal recovery
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Atomic Decomposition by Basis Pursuit
- Robust principal component analysis?
- A Singular Value Thresholding Algorithm for Matrix Completion
- A remark on global positioning from local distances
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Decoding by Linear Programming
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Sparse and Redundant Representations
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Signal Recovery by Proximal Forward-Backward Splitting
- Stable signal recovery from incomplete and inaccurate measurements
- Convex analysis and monotone operator theory in Hilbert spaces
- Compressed sensing
- Unnamed Item
This page was built for publication: The Moreau envelope based efficient first-order methods for sparse recovery
