Greedy Algorithms for Nonnegativity-Constrained Simultaneous Sparse Recovery.

ABSTRACT: This work proposes a family of greedy algorithms to jointly reconstruct a set of vectors that are (i) nonnegative and (ii) simultaneously sparse with a shared support set. The proposed algorithms generalize previous approaches that were designed to impose these constraints individually. Similar to previous greedy algorithms for sparse recovery, the proposed algorithms iteratively identify promising support indices. In contrast to previous approaches, the support index selection procedure has been adapted to prioritize indices that are consistent with both the nonnegativity and shared support constraints. Empirical results demonstrate for the first time that the combined use of simultaneous sparsity and nonnegativity constraints can substantially improve recovery performance relative to exi

SUBMITTER: Kim D 

PROVIDER: S-EPMC4784713 | biostudies-literature | 2016 Aug

REPOSITORIES: biostudies-literature