  We consider linear sparse recovery problems where additional structure
regarding the support of the solution is known. The form of the structure
considered is non-overlapping sets of indices that each contain part of the
support. An algorithm based on iterative hard thresholding is proposed to solve
this problem. The convergence and error of the method are analyzed with respect
to mutual coherence. Numerical simulations are examined in the context of an
inverse source problem, including modifications for off-grid recovery
