Efficient Computation of the Pareto Boundary for the MISO Interference Channel with Perfect CSI
The authors consider the two-user Multiple-Input Single-Output (MISO) interference channel and the rate region which is achieved when the receivers treat the interference as additive Gaussian noise and the transmitters have perfect Channel State Information (CSI). They propose a computationally efficient method for calculating the Pareto boundary of the rate region. They show that the problem of finding an arbitrary Pareto-optimal rate pair, along with its enabling beamforming vector pair, can be cast as a sequence of Second-Order Cone Programming (SOCP) feasibility problems. The SOCP problems are convex and they are solved very efficiently using standard off-the-shelf (namely, interior-point) algorithms.