A relaxed-PPA contraction method for sparse signal recovery

DOI10.1007/s12204-012-1243-7zbMath1283.94015MaRDI QIDQ2440190

Xiaoling Fu, Xiang-Feng Wang

Publication date: 27 March 2014

Published in: Journal of Shanghai Jiaotong University (Science) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12204-012-1243-7

zbMATH Keywords

convex programming; contraction method; sparse signal recovery; proximal point algorithm (PPA)

Mathematics Subject Classification ID

94A12: Signal theory (characterization, reconstruction, filtering, etc.)

Uses Software

• NESTA
• TFOCS

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Templates for convex cone problems with applications to sparse signal recovery
• Sparsity oracle inequalities for the Lasso
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
• Monotone Operators and the Proximal Point Algorithm
• Atomic Decomposition by Basis Pursuit
• Sparse Reconstruction by Separable Approximation
• The Linearized Alternating Direction Method of Multipliers for Dantzig Selector
• Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
• Signal Recovery by Proximal Forward-Backward Splitting
• Compressed sensing