A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing
From MaRDI portal
Publication:2405990
DOI10.1007/s00034-017-0498-5zbMath1371.94548OpenAlexW2585504759MaRDI QIDQ2405990
Yongchao Yu, Angang Cui, Xuanli Han, Ji-Gen Peng
Publication date: 26 September 2017
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00034-017-0498-5
Minimax problems in mathematical programming (90C47) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Uses Software
Cites Work
- Nearly unbiased variable selection under minimax concave penalty
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Douglas-Rachford splitting method for semidefinite programming
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- A mathematical introduction to compressive sensing
- Statistics for high-dimensional data. Methods, theory and applications.
- On the convergence rate of Douglas-Rachford operator splitting method
- Sparsity in time-frequency representations
- Fast linearized Bregman iteration for compressive sensing and sparse denoising
- Removing multiplicative noise by Douglas-Rachford splitting methods
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
- An alternating direction method for finding Dantzig selectors
- Full spark frames
- A matrix-free smoothing algorithm for large-scale support vector machines
- Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data
- Exact matrix completion via convex optimization
- DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS
- A survey on operator splitting and decomposition of convex programs
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit
- A Preconditioner for A Primal-Dual Newton Conjugate Gradient Method for Compressed Sensing Problems
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Sparse and Redundant Representations
- Atomic Decomposition by Basis Pursuit
- Identification of Matrices Having a Sparse Representation
- High-Resolution Radar via Compressed Sensing
- Hybrid Random/Deterministic Parallel Algorithms for Convex and Nonconvex Big Data Optimization
- De-noising by soft-thresholding
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
- Primal-Dual Decomposition by Operator Splitting and Applications to Image Deblurring
- 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
- Convex analysis and monotone operator theory in Hilbert spaces
- Compressed sensing
- Modern sampling theory. Mathematics and applications
