Greedy Algorithms for Joint Sparse Recovery

DOI10.1109/TSP.2014.2301980MaRDI QIDQ4579101zbMATH OpenOpenAlexFDO

Authors Jeffrey D. Blanchard, Michael Cermak, David Hanle, Yirong Jing

Publication date 22 August 2018

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

Full work available at URL https://doi.org/10.1109/tsp.2014.2301980

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(12)

• Efficient Least Residual Greedy Algorithms for Sparse Recovery
• Greedy subspace pursuit for joint sparse recovery
• Joint sparse recovery based on variances
• Joint sparse optimization: lower-order regularization method and application in cell fate conversion
• Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
• Framework for segmented threshold \(\ell_0\) gradient approximation based network for sparse signal recovery
• Stochastic greedy algorithms for multiple measurement vectors
• On rank awareness, thresholding, and MUSIC for joint sparse recovery
• Constrained mix sparse optimization via hard thresholding pursuit
• Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
• CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
• Analysis of convergence for the alternating direction method applied to joint sparse recovery

This page was built for publication: Greedy Algorithms for Joint Sparse Recovery

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