The springback penalty for robust signal recovery
From MaRDI portal
Publication:2168687
DOI10.1016/j.acha.2022.07.002zbMath1496.94010arXiv2110.06754OpenAlexW3207165257MaRDI QIDQ2168687
Congpei An, Hao-Ning Wu, Xiao-Ming Yuan
Publication date: 26 August 2022
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.06754
Numerical optimization and variational techniques (65K10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Iterative numerical methods for linear systems (65F10) Sampling theory in information and communication theory (94A20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- A unified approach to model selection and sparse recovery using regularized least squares
- A mathematical introduction to compressive sensing
- Iterative hard thresholding for compressed sensing
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- On DC based methods for phase retrieval
- Reconstruction and subgaussian operators in asymptotic geometric analysis
- Minimization of transformed \(l_1\) penalty: closed form representation and iterative thresholding algorithms
- Atomic Decomposition by Basis Pursuit
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Compressed sensing recovery via nonconvex shrinkage penalties
- Restricted isometry properties and nonconvex compressive sensing
- On sparse reconstruction from Fourier and Gaussian measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- First-Order Methods in Optimization
- The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming
- Regularization and Variable Selection Via the Elastic Net
- Stable signal recovery from incomplete and inaccurate measurements
- Proximité et dualité dans un espace hilbertien
- Compressed sensing
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
