Algorithm 1 Alternating Direction Method of Multipliers

Input: $\xi , \eta , P \kappa$ Output: Channel allocation $\mathit{u}$; Power allocation $\mathit{p}$  Initialization: Initialize ${\mathit{p}}^{(0)}$, ${\mathit{u}}^{(0)}$; $\alpha$ and $\beta$ randomly, let $t=0$;  repeat   $t=t+1$;   With ${\mathit{p}}^{(\mathrm{t})}$, ${\mathit{u}}^{(t)}$ and ${\mathit{w}}^{(t)}$, update ${\mathit{u}}^{(t+1)}$ by solving (21);   With ${\mathit{p}}^{(\mathrm{t})}$, ${\mathit{u}}^{(t)}$ and ${\mathit{u}}^{(t+1)}$, update ${\mathit{w}}^{(t+1)}$ by solving (19);   With ${\mathit{u}}^{(t+1)}$, ${\mathit{u}}^{(t)}$ and ${\mathit{w}}^{(t+1)}$, update ${\mathit{p}}^{(\mathrm{t}+1)}$ by solving (21);   With ${\mathit{u}}^{(t+1)}$, ${\mathit{p}}^{(\mathrm{t}+1)}$ and ${\mathit{w}}^{(t+1)}$, update ${\mathit{\nu }}^{(t+1)}$ by solving (20); until Convergence