Near Optimum Power Control and Precoding under Fairness Constraints in Network MIMO Systems

Algorithm 1

Series of convex approximations.

Initialize 𝐩⁽⁰⁾, 𝜃⁽⁰⁾, and 𝛽⁽⁰⁾ to some feasible values for

the original problem (30).

Start with iteration step 𝑡=1.

 (1) Solve the approximate optimization problem (35).

   Let {Γ^(𝑡),𝐩^(𝑡)} denote the solution of the 𝑡th

   iteration.

 (2) Update 𝜽^(𝑡+1), 𝜷^(𝑡+1) at 𝐱₀^(𝑡)=𝛾(𝐩^(𝑡)).

 (3) Update 𝑡=𝑡+1 and repeat until convergence