Algorithm 1.

The algorithm to solve (2)

1.	Input: D
2.	Initialize: B̂ = 0, Z = 0 and Y = 0
3.	repeat
4.	$\mathrm{B̂}\leftarrow {\text{arg min}}_{\mathrm{B̂}}\frac{1}{2}{\Vert \frac{D+\rho (Z^k-\frac{1}{\rho }{Y}^k)}{1+\rho }-\mathrm{B̂}\Vert }_F^2+\frac{\alpha }{1+\rho }{\Vert \mathrm{B̂}\Vert }_{*}$
5.	for j = 1 to n do
6.	$Z_j\leftarrow {\text{arg min}}_{\mathbf{x}}\frac{1}{2}{\Vert {\mathrm{B̂}}_j+\frac{1}{\rho }{Y}_j-\mathbf{x}\Vert }_2^2+\frac{\gamma }{\rho }{\Vert \mathbf{x}\Vert }_{TV}$
7.	end for
8.	Y ← Y + ρ(B̂ − Z)
9.	until convergence
10.	Output: B̂.