Non-convex compressed sensing with the sum-of-squares method

DOI10.1137/1.9781611974331.CH42zbMATH Open1441.94051OpenAlexW4248444295MaRDI QIDQ4575619FDOQ4575619

Authors: Tasuku Soma, Yuichi Yoshida 

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch42

Recommendations

• Stable signal recovery from incomplete and inaccurate measurements
• Recovery of sparsest signals via \(\ell^q \)-minimization
• Restricted isometry properties and nonconvex compressive sensing
• Sparse signals recovered by non-convex penalty in quasi-linear systems
• Sparse signal recovery via non-convex optimization and overcomplete dictionaries

Mathematics Subject Classification ID

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

Cited In (3)

• Dequantizing Compressed Sensing: When Oversampling and Non-Gaussian Constraints Combine
• A non-convex regularization approach for compressive sensing
• Improved Algorithms for Adaptive Compressed Sensing

This page was built for publication: Non-convex compressed sensing with the sum-of-squares method

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