In the cooperative cellular network, relay-like base stations are connected to the central processor (CP) via rate-limited fronthaul links and the joint processing is performed at the CP, which thus can effectively mitigate the multiuser interference. In this paper, we consider the joint beamforming and compression problem with per-antenna power constraints in the cooperative cellular network. We first establish the equivalence between the considered problem and its semidefinite relaxation (SDR). Then we further derive the partial Lagrangian dual of the SDR problem and show that the objective function of the obtained dual problem is differentiable. Based on the differentiability, we propose two efficient projected gradient ascent algorithms for solving the dual problem, which are projected exact gradient ascent (PEGA) and projected inexact gradient ascent (PIGA). While PEGA is guaranteed to find the global solution of the dual problem (and hence the global solution of the original problem), PIGA is more computationally efficient due to the lower complexity in inexactly computing the gradient. Global optimality and high efficiency of the proposed algorithms are demonstrated via numerical experiments.

翻译：在协作蜂窝网络中，类似中继的基站通过速率受限的前传链路连接到中央处理器（CP），并在CP处进行联合处理，从而能够有效抑制多用户干扰。本文研究了协作蜂窝网络中考虑每天线功率约束的联合波束赋形与压缩问题。我们首先建立了所考虑问题与其半定松弛（SDR）之间的等价性。随后进一步推导了SDR问题的部分拉格朗日对偶，并证明所得对偶问题的目标函数是可微的。基于可微性，我们提出了两种高效的投影梯度上升算法来求解对偶问题，即投影精确梯度上升（PEGA）与投影非精确梯度上升（PIGA）。尽管PEGA能够保证找到对偶问题的全局解（进而得到原问题的全局解），但PIGA由于非精确计算梯度的复杂度更低而具有更高的计算效率。数值实验证明了所提算法的全局最优性与高效性。