Support Recovery of Greedy Block Coordinate Descent Using the Near Orthogonality Property

الملخص EN

In this paper, using the near orthogonal property, we analyze the performance of greedy block coordinate descent (GBCD) algorithm when both the measurements and the measurement matrix are perturbed by some errors.

An improved sufficient condition is presented to guarantee that the support of the sparse matrix is recovered exactly.

A counterexample is provided to show that GBCD fails.

It improves the existing result.

By experiments, we also point out that GBCD is robust under these perturbations.