Binary least squares: an algorithm for binary sparse signal recovery

DOI10.4208/JCM.2308-M2023-0044MaRDI QIDQ7019783zbMATH OpenFDO

Authors Jinming Wen

Publication date 5 March 2025

Published in Journal of Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4208/JCM.2308-M2023-0044

zbMATH Keywords

binary least squaresbinary sparse signalprecise support reconstruction

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical solution to inverse problems in abstract spaces (65J22) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cites work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A mathematical introduction to compressive sensing
• A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit
• A tight bound of hard thresholding
• Binary sparse signal recovery with binary matching pursuit
• Compressed sensing
• Conjugate Gradient Iterative Hard Thresholding: Observed Noise Stability for Compressed Sensing
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Decoding by Linear Programming
• Global optimality conditions for quadratic optimization problems with binary constraints
• Greed is Good: Algorithmic Results for Sparse Approximation
• Hard thresholding pursuit: an algorithm for compressive sensing
• Iterative hard thresholding for compressed sensing
• Latent Variable Bayesian Models for Promoting Sparsity
• Nearly Optimal Bounds for Orthogonal Least Squares
• Newton-Step-Based Hard Thresholding Algorithms for Sparse Signal Recovery
• Optimal Restricted Isometry Condition of Normalized Sampling Matrices for Exact Sparse Recovery With Orthogonal Least Squares
• Orthogonal least squares methods and their application to non-linear system identification
• Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
• Recovery of Binary Sparse Signals With Biased Measurement Matrices
• Recovery of Sparse Signals Using Multiple Orthogonal Least Squares
• Relaxed Recovery Conditions for OMP/OLS by Exploiting Both Coherence and Decay
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Sparse Activity Detection for Massive Connectivity
• Stable Recovery of Sparse Signals and an Oracle Inequality
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• Uncertainty principles and ideal atomic decomposition

This page was built for publication: Binary least squares: an algorithm for binary sparse signal recovery

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