Robust 1-bit compressed sensing with iterative hard thresholding

DOI10.1137/1.9781611977912.105MaRDI QIDQ6645466zbMATH OpenFDO

Authors Namiko Matsumoto, Arya Mazumdar

Publication date 28 November 2024

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• Robust one-bit compressed sensing via continuous sign approximation and hybrid ordinary-Welsch function
• Robust instance optimal phase-only compressed sensing

This page was built for publication: Robust 1-bit compressed sensing with iterative hard thresholding

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