Nesterov's algorithm solving dual formulation for compressed sensing
From MaRDI portal
Publication:2511178
DOI10.1016/j.cam.2013.09.032zbMath1293.65090MaRDI QIDQ2511178
Bruce W. Suter, Feishe Chen, Yuesheng Xu, Li-Xin Shen
Publication date: 5 August 2014
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.2013.09.032
compressed sensing; proximity operator; Moreau envelope; Nesterov's algorithm; \(\ell_1\) regularization
65K10: Numerical optimization and variational techniques
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Proximity algorithms for image models: denoising
- Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Preconditioned alternating projection algorithms for maximum a posteriori ECT reconstruction
- A proximity algorithm accelerated by Gauss–Seidel iterations for L1/TV denoising models
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Atomic Decomposition by Basis Pursuit
- Wavelet Algorithms for High-Resolution Image Reconstruction
- Sparse Reconstruction by Separable Approximation
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- 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
- Proximité et dualité dans un espace hilbertien
- Convex analysis and monotone operator theory in Hilbert spaces
- Compressed sensing
