Weakly Convex Regularized Robust Sparse Recovery Methods With Theoretical Guarantees

DOI10.1109/TSP.2019.2935906MaRDI QIDQ5240465zbMATH OpenOpenAlexFDO

Authors Chengzhu Yang, Xinyue Shen, Hongbing Ma, Badong Chen, Y. T. Gu, H. C. So

Publication date 28 October 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2019.2935906

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(6)

• Stability of 1-bit compressed sensing in sparse data reconstruction
• Scalable robust matrix recovery: Frank-Wolfe meets proximal methods
• Robustness of Sparse Recovery via <inline-formula> <tex-math notation="LaTeX">$F$ </tex-math></inline-formula>-Minimization: A Topological Viewpoint
• Robust recovery of a kind of weighted l1-minimization without noise level
• Weakly decomposable regularization penalties and structured sparsity
• Error estimates for weakly convex frame-based regularization including learned filters

This page was built for publication: Weakly Convex Regularized Robust Sparse Recovery Methods With Theoretical Guarantees

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