Nonconvex \(\ell_p-\alpha\ell_q\) minimization method and \(p\)-RIP condition for stable recovery of approximately \(k\)-sparse signals
From MaRDI portal
Publication:6151971
DOI10.1007/S40314-023-02560-YOpenAlexW4390274147MaRDI QIDQ6151971
No author found.
Publication date: 12 February 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-023-02560-y
Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Statistical aspects of information-theoretic topics (62B10)
Cites Work
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A mathematical introduction to compressive sensing
- Iterative hard thresholding for compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Unsteady flow prediction from sparse measurements by compressed sensing reduced order modeling
- Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
- A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Restricted isometry properties and nonconvex compressive sensing
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- ℓ 1 − αℓ 2 minimization methods for signal and image reconstruction with impulsive noise removal
- Uniform RIP Conditions for Recovery of Sparse Signals by $\ell _p\,(0< p\leq 1)$ Minimization
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Compressed sensing
This page was built for publication: Nonconvex \(\ell_p-\alpha\ell_q\) minimization method and \(p\)-RIP condition for stable recovery of approximately \(k\)-sparse signals
