Energy-Spectral Efficiency Trade-Offs in Full-Duplex MU-MIMO Cloud-RANs with SWIPT

Algorithm 2

Iterative algorithm for finding the optimal Pareto set.

Initialization: Set the error tolerance , the maximum number of iteration , maximum and ; Set weighted parameter sets and ;

Generating initial set of by solving max-min problem (58a) and (58b);

Find the optimum and by solving (29a), (29b), (30a), and (30b), respectively, with Algorithm 1;

repeat

 Update ; Set ;

 repeat

  Given , , find the optimal set by solving convex problem (54a) and (54b);

  Update and ;

  Compute with is objective value in (54a);

 until reaches or ;

 Update the -th component of the Pareto set: ;

until reaches ;

Output: The optimal Pareto set .