A Greedy Multistage Convex Relaxation Algorithm Applied to Structured Group Sparse Reconstruction Problems Based on Iterative Support Detection

Algorithm 1

Primal-based ADM for group sparsity [9].

Set . Initialize ,

and , , .

While stopping criterion is not met Do

(1) Update :

   Compute according to (14) for given .

(2) Update :

   Compute by solving (13).

(3) Update and :

   Update and via (17).

(4) .

end while