Greedy Algorithms for Joint Sparse Recovery

DOI10.1109/TSP.2014.2301980zbMath1394.94082OpenAlexW2049808850MaRDI QIDQ4579101

Michael Cermak, Jeffrey D. Blanchard, 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)

Related Items (7)

Framework for segmented threshold \(\ell_0\) gradient approximation based network for sparse signal recovery ⋮ CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion ⋮ Greedy subspace pursuit for joint sparse recovery ⋮ Analysis of convergence for the alternating direction method applied to joint sparse recovery ⋮ Joint Sparse Recovery Based on Variances ⋮ On rank awareness, thresholding, and MUSIC for joint sparse recovery ⋮ Stochastic greedy algorithms for multiple measurement vectors

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