Efficient max-min power control for cell-free massive mimo systems: An alternating projection-based approach

We consider the problem of max-min power control for downlink cell-free (CF) massive MIMO systems. Under the bisection framework, solving this problem amounts to solving a sequence of convex conic feasibility checking problems (CCFCP). Unfortunately, the problem size of the CCFCP of the CF massive MIMO system grows rapidly as the number of users and access points (AP) increases. Existing feasibility checking methods become computationally intractable even when the system consists of only a moderate number of users and APs. To address this limitation, we propose to reformulate the CCFCP as a two-set feasibility problem, which is then solved by the averaged alternating reflection (AAR) algorithm. The proposed method outperforms existing methods significantly in terms of computational efficiency.