Abstract
The performance of multiuser systems is both difficult to measure fairly and to solve optimally. Most resource allocation problems are non-convex, even under simplifying assumptions such as perfect channel knowledge, homogeneous channel properties among users, and simple power constraints. Herein, we establish a general optimization framework that systematically solves these problems to global optimality. The proposed branch-reduce-and-bound (BRB) algorithm handles general multicell downlink systems with single-antenna users, multiantenna transmitters, arbitrary linear power constraints, and robustness to channel uncertainty. The problem of robust optimization with fairness-profile is solved at each iteration, which is a quasi-convex problem and a novel generalization of regular max-min fairness. The BRB algorithm is in general computationally costly, but it shows far better convergence than the previously known outer polyblock approximation algorithm. Our framework is suitable for computing benchmarks in general multicell systems with or without channel uncertainty. We illustrate this by deriving and evaluating a zero-forcing solution to the general problem.

This publication has 31 references indexed in Scilit: