Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations
From MaRDI portal
Publication:829377
DOI10.1007/S11425-018-9467-7zbMath1470.65058OpenAlexW3045832197MaRDI QIDQ829377
Zheng Peng, Zilin Huang, Wen-Xing Zhu, Jian-Li Chen
Publication date: 6 May 2021
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-018-9467-7
Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Uses Software
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A mathematical introduction to compressive sensing
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- Iterative thresholding for sparse approximations
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- 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\)
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- An affine scaling methodology for best basis selection
- A Proximal-Gradient Homotopy Method for the Sparse Least-Squares Problem
- Exact Penalty Decomposition Method for Zero-Norm Minimization Based on MPEC Formulation
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Analyzing Weighted $\ell_1$ Minimization for Sparse Recovery With Nonuniform Sparse Models
- Sparse Approximate Solutions to Linear Systems
- Matching pursuits with time-frequency dictionaries
- Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- A New Computational Method for the Sparsest Solutions to Systems of Linear Equations
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Sparse Approximation via Penalty Decomposition Methods
- Stable signal recovery from incomplete and inaccurate measurements
- Sparse Signal Reconstruction via Iterative Support Detection
This page was built for publication: Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations