A non-convex regularization approach for compressive sensing
DOI10.1007/S10444-018-9627-3zbMATH Open1415.90088OpenAlexW2885285107WikidataQ129406434 ScholiaQ129406434MaRDI QIDQ2000486FDOQ2000486
Authors: Ya-Ru Fan, Alessandro Buccini, Marco Donatelli, Ting-Zhu Huang 
Publication date: 28 June 2019
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11584/278179
Recommendations
- Compressive Sensing via Nonlocal Low-Rank Regularization
- Compressed sensing recovery via nonconvex shrinkage penalties
- Non-convex compressed sensing with the sum-of-squares method
- Iterative \({\ell_1}\) minimization for non-convex compressed sensing
- Non-convex compressed sensing using partial support information
- Restricted isometry properties and nonconvex compressive sensing
- Nonlinear approximation and compressed sensing
- An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems
- Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
- A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation
Numerical optimization and variational techniques (65K10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Nonconvex programming, global optimization (90C26)
Cites Work
- NESTA: A fast and accurate first-order method for sparse recovery
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- A Singular Value Thresholding Algorithm for Matrix Completion
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressed sensing
- Split Bregman methods and frame based image restoration
- Bregmanized nonlocal regularization for deconvolution and sparse reconstruction
- Title not available (Why is that?)
- A Probabilistic and RIPless Theory of Compressed Sensing
- Alternating direction method with Gaussian back substitution for separable convex programming
- Globally convergent block-coordinate techniques for unconstrained optimization
- Linearized Bregman Iterations for Frame-Based Image Deblurring
- Generalized sampling and infinite-dimensional compressed sensing
- BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING
- Compressive Sensing via Nonlocal Low-Rank Regularization
- Generalized Higher Degree Total Variation (HDTV) Regularization
- Majorization-minimization generalized Krylov subspace methods for \({\ell _p}\)-\({\ell _q}\) optimization applied to image restoration
Cited In (9)
- Compressive Sensing on Manifolds Using a Nonparametric Mixture of Factor Analyzers: Algorithm and Performance Bounds
- A Bregman-style improved ADMM and its linearized version in the nonconvex setting: convergence and rate analyses
- Dequantizing Compressed Sensing: When Oversampling and Non-Gaussian Constraints Combine
- Matrix-free interior point method for compressed sensing problems
- A non-convex denoising model for impulse and Gaussian noise mixture removing using bi-level parameter identification
- On a variational problem with a nonstandard growth functional and its applications to image processing
- Linearized Bregman iterations for compressed sensing
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
- A non-convex PDE-constrained denoising model for impulse and Gaussian noise mixture reduction
Uses Software
This page was built for publication: A non-convex regularization approach for compressive sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000486)
