One-Bit Compressive Sensing With Projected Subgradient Method Under Sparsity Constraints

DOI10.1109/TIT.2019.2922328MaRDI QIDQ5211466zbMATH OpenOpenAlexFDO

Authors

Publication date 28 January 2020

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

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

Mathematics Subject Classification ID

Methods of reduced gradient type (90C52) Derivative-free methods and methods using generalized derivatives (90C56) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(6)

• A study on distributed optimization over large-scale networked systems
• Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
• Descending iterative hard thresholding: a robust approach to sparse recovery under heavy-tailed noise
• Binary iterative hard thresholding converges with optimal number of measurements for 1-bit compressed sensing
• Robust one-bit compressed sensing via continuous sign approximation and hybrid ordinary-Welsch function
• Tsallis entropy penalized robust 1-bit compressive sensing against sign flips

This page was built for publication: One-Bit Compressive Sensing With Projected Subgradient Method Under Sparsity Constraints

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