New RIP Bounds for Recovery of Sparse Signals With Partial Support Information via Weighted {\ell_{p}} -Minimization

DOI10.1109/TIT.2020.2966436MaRDI QIDQ5124407zbMATH OpenOpenAlexFDO

Authors

Publication date 29 September 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2020.2966436

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(7)

• Weighted \(\ell_p\) (\(0<p\le 1\)) minimization with non-uniform weights for sparse recovery under partial support information
• Robust recovery of signals with partially known support information using weighted BPDN
• Weighted _p-minimization for sparse signal recovery under arbitrary support prior
• Stable recovery of approximately block \(k\)-sparse signals with partial block support information via weighted \(\ell_2/\ell_p\) (\(0 < p \leq 1\)) minimization
• Uniform RIP analysis for the _p- _q minimization
• Uniform RIP bounds for recovery of signals with partial support information by weighted _p-minimization
• Low tubal-rank tensor recovery with adversarial sparse noises

This page was built for publication: New RIP Bounds for Recovery of Sparse Signals With Partial Support Information via Weighted ${\ell_{p}}$ -Minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124407)