Algorithm 1 MM method

Initialize:$\mathbf{V}={\mathbf{V}}_0$, $\gamma$, $K^2$, $K_l=\lfloor \frac{K-1}{2}\rfloor$, $K_r=\lfloor \frac{K}{2}\rfloor$, $\epsilon$, Maximum inner iterations NIt, $n=0$ While$\frac{{\parallel {\mathbf{V}}^{\left(n+1\right)}-{\mathbf{V}}^{\left(n\right)}\parallel }_2}{{\parallel {\mathbf{V}}^{\left(n\right)}\parallel }_2}>\epsilon orn<\mathrm{NIt}$do compute ${\left[{\mathbf{D}}^2\left({\mathbf{V}}^{\left(n\right)}\right)\right]}_{m,m}={\sum }_{i=-K_l}^{K_r}{{\sum }_{j=-K_l}^{K_r}\left\{{\sum }_{k_1=-K_l}^{K_r}{\sum }_{k_2=-K_l}^{K_r}{\left|{\mathbf{V}}_{m-i+k_1,m-j+k_2}^{\left(k\right)}\right|}^2\right\}}^{-\frac{1}{2}}$ compute ${\mathbf{V}}^{\left(n+1\right)}=\mathbf{mat}\left\{{\left(\mathbf{I}+\gamma {\mathbf{D}}^2\left({\mathbf{V}}^{\left(n\right)}\right)\right)}^{-1}{\mathbf{V}}_0\right\}$ compute $n=n+1$ End While Return${\mathbf{V}}^{\left(n\right)}$