Algorithm 3 The algorithm for solving problem (23).

Initialization phase:

Set ${\mathbf{p}}_{fn}^{\left(0\right)}$, iteration index $v=0$, the maximum iterations $V_{max}$ and error tolerance $\mu$. Calculate $f_n\left({{\mathbf{p}}_{fn}}^{\left(0\right)}\right)-{{\eta }_n}^{\left(c\right)}{g}_n\left({{\mathbf{p}}_{fn}}^{\left(0\right)}\right)$.

1: repeat

2: Solve the problem (23) to obtain the optimal solution ${\mathbf{p}}_{fn}^{*}$ for given ${\mathbf{p}}_{fn}^{\left(v\right)}$ and ${{\eta }_n}^{\left(c\right)}$.

3: $v=v+1$.

4: Set ${\mathbf{p}}_{fn}^{\left(v\right)}={\mathbf{p}}_{fn}^{*}$ and cacluate $f_n\left({{\mathbf{p}}_{fn}}^{\left(v\right)}\right)-{{\eta }_n}^{\left(c\right)}{g}_n\left({{\mathbf{p}}_{fn}}^{\left(v\right)}\right)$.

5: until $\left|f_n\left({{\mathbf{p}}_{fn}}^{\left(v\right)}\right)-{{\eta }_n}^{\left(c\right)}{g}_n\left({{\mathbf{p}}_{fn}}^{\left(v\right)}\right)\right.-\left.(f_n\left({{\mathbf{p}}_{fn}}^{(v-1)}\right)-{{\eta }_n}^{\left(c\right)}{g}_n\left({{\mathbf{p}}_{fn}}^{(v-1)}\right))\right|\le \mu$

6: ${\mathbf{p}}_{fn}^{*}{=\mathbf{p}}_{fn}^{\left(v\right)}$.