Joint <formula formulatype="inline"><tex Notation="TeX">$k$</tex> </formula>-Step Analysis of Orthogonal Matching Pursuit and Orthogonal Least Squares

DOI10.1109/TIT.2013.2238606zbMath1364.94160arXiv1111.0522MaRDI QIDQ2989280

Cédric Herzet, Charles Soussen, Jérôme Idier, Rémi Gribonval

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.0522

Mathematics Subject Classification ID

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

Related Items (6)

Required Number of Iterations for Sparse Signal Recovery via Orthogonal Least Squares ⋮ A new sufficient condition for sparse recovery with multiple orthogonal least squares ⋮ When does OMP achieve exact recovery with continuous dictionaries? ⋮ Matrix-wise \(\ell_0\)-constrained sparse nonnegative least squares ⋮ The sliding Frank–Wolfe algorithm and its application to super-resolution microscopy ⋮ Perturbation Analysis of Orthogonal Least Squares

This page was built for publication: Joint <formula formulatype="inline"><tex Notation="TeX">$k$</tex> </formula>-Step Analysis of Orthogonal Matching Pursuit and Orthogonal Least Squares