Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model
From MaRDI portal
Publication:6062413
DOI10.1186/s13660-023-02932-2OpenAlexW4321492731MaRDI QIDQ6062413
Saroj R. Yadav, Hare Krishna Nigam
Publication date: 30 November 2023
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-023-02932-2
Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Matrix completion problems (15A83)
Cites Work
- Unnamed Item
- Block sparse recovery via mixed \(l_2/l_1\) minimization
- A unified algebraic approach to 2-D and 3-D motion segmentation and estimation
- The restricted isometry property and its implications for compressed sensing
- Compressed sensing of color images
- Smoothing inertial projection neural network for minimization \(L_{p-q}\) in sparse signal reconstruction
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
- A new bound on the block restricted isometry constant in compressed sensing
- Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing
- A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Sparse representations in unions of bases
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Atomic Decomposition by Basis Pursuit
- On the rank minimization problem over a positive semidefinite linear matrix inequality
- Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
- Sparse Approximate Solutions to Linear Systems
- Robust Recovery of Signals From a Structured Union of Subspaces
- The High Order Block RIP Condition for Signal Recovery
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Restricted $p$-Isometry Properties of Nonconvex Matrix Recovery
- A sparse signal reconstruction perspective for source localization with sensor arrays
- Stable signal recovery from incomplete and inaccurate measurements
- Empirical Bayes Estimation of a Sparse Vector of Gene Expression Changes
- Compressed sensing
This page was built for publication: Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model
