. Author manuscript; available in PMC: 2017 Mar 1.

Published in final edited form as: IEEE Trans Biomed Eng. 2015 Aug 11;63(3):607–618. doi: 10.1109/TBME.2015.2466616

Algorithm 1.

Pseudo code of solving Eq. (5).

	Input: η(0) = 1, α(1) = 1, γ = 0.2, λ₁, λ₂;
	Output: W;
1	Initialize t = 1;
2	Initialize W(1) as a random diagonal matrix;
3	repeat
4		while L(W(t)) > G_η(t−1)(π_η(t−1)(W(t)), W(t)) do
5			Set η(t − 1) = γη(t − 1) /* γ `is a`
			`predefined constant (For details`,
			`refer to` Appendix A) */;
6		end
7		Set η(t) = η(t − 1);
8		Compute $W (t + 1) = arg min_{W} G_{η (t)} (W, V (t))$ ;
9		Compute $α (t + 1) = \frac{1 + \sqrt{1 + 4 α {(t)}^{2}}}{2}$ ;
10		Compute Eq. (11);
11	until Eq. (5) converges;