Computing one-bit compressive sensing via double-sparsity constrained optimization

DOI10.1109/TSP.2022.3156911MaRDI QIDQ6602806zbMATH OpenFDO

Authors Sheng-Long Zhou, Ziyan Luo, Naihua Xiu, G. Y. Li

Publication date 12 September 2024

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

Full work available at URL https://doi.org/10.1109/TSP.2022.3156911

Mathematics Subject Classification ID

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

Cited in

(4)

• Subspace Newton method for sparse group \(\ell_0\) optimization problem
• Computing one-bit compressive sensing via zero-norm regularized DC loss model and its surrogate
• Optimality conditions and gradient descent Newton pursuit for 0/1-loss and sparsity constrained optimization
• Robust one-bit compressed sensing via continuous sign approximation and hybrid ordinary-Welsch function

This page was built for publication: Computing one-bit compressive sensing via double-sparsity constrained optimization

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