Algorithm 1 Bisection Algorithm for Solving $P_2$

Input: $M,K,N,N_1,\tau ,{\rho }_{\mathrm{d}},{\gamma }_{mk}.$

Output: ${\epsilon }_k,\forall k,\forall m$

(1) Initialize the lower value $r_{\mathrm{l}}$ and the upper bound $r_{\mathrm{u}}$. Give the tolerance $\delta >0.$

(2) While $r_{\mathrm{u}}-r_{\mathrm{l}}\le \delta$

(3) Set $r=\left(r_{\mathrm{l}}+t_{\mathrm{u}}\right)/2$ and solve the following feasible problem ${\tilde{P}}_2$.

(4) If ${\tilde{P}}_2$ is feasible, set $r_{\mathrm{l}}=r$, go to step 2, else set $r_{\mathrm{u}}=r$.

(5) end If

(6) end While