investigate the problem of jointly optimizing user pairing and beam-forming design to
maximize the minimum rate among all users. The considered problem belongs to a difficult
class of mixed-integer nonconvex optimization programming. We first relax the binary
constraints and adopt sequential convex approximation method to solve the relaxed
problem, which is guaranteed to converge at least to a locally optimal solution. Numerical …