On Power Minimization for Non-orthogonal Multiple Access (NOMA)

We formulate a power optimization problem for non-orthogonal multiple access systems mathematically, and prove its NP-hardness. For tackling the problem, we first identify a convex problem by relaxation. Based on this convexity, we then propose an efficient “relax-then-adjust” algorithm and provide results of performance evaluation.