arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.06750math.OCeess.SP
收藏

MIMO互扰信道中的能量效率optimization:连续伪凸近似方法

Energy efficiency optimization in MIMO interference channels: A successive pseudoconvex approximation approach

Yang Yang, Marius Pesavento, Symeon Chatzinotas, Björn Ottersten

摘要:

本文研究了下行链路多输入多输出多小区系统中所有用户都受到多用户干扰时的能量效率(全局和和)最优化问题。由于以下几个原因,这是一个具有挑战性的问题:1)这是一个非凸分式规划问题,2)传输速率函数由(复值)传输协方差阵表征,以及3)与处理相关的功耗可能取决于传输速率。我们解决这个问题的逐次伪凸逼近的方法,我们认为,伪凸优化在设计新的迭代算法中起着重要的作用,不仅因为每一个局部最优点的伪凸最优化问题也是全局最优的,而且还因为下降方向很容易从每一个最优点的伪凸最优化问题。所提出的算法具有以下优点:1)收敛速度快,因为在每次迭代求解的近似问题中尽可能多地保留了原最优化问题的结构; 2)易于实现,因为每个近似问题都适合并行计算,并且其解具有封闭形式的表达式; 3)保证收敛到一个稳定点或Karush-Kuhn-Tucker点。数值计算表明了该算法的优越性。

英文摘要:

In this paper, we consider the (global and sum) energy efficiency optimization problem in downlink multi-input multi-output multi-cell systems, where all users suffer from multi-user interference. This is a challenging problem due to several reasons: 1) it is a nonconvex fractional programming problem, 2) the transmission rate functions are characterized by (complex-valued) transmit covariance matrices, and 3) the processing-related power consumption may depend on the transmission rate. We tackle this problem by the successive pseudoconvex approximation approach, and we argue that pseudoconvex optimization plays a fundamental role in designing novel iterative algorithms, not only because every locally optimal point of a pseudoconvex optimization problem is also globally optimal, but also because a descent direction is easily obtained from every optimal point of a pseudoconvex optimization problem. The proposed algorithms have the following advantages: 1) fast convergence as the structure of the original optimization problem is preserved as much as possible in the approximate problem solved in each iteration, 2) easy implementation as each approximate problem is suitable for parallel computation and its solution has a closed-form expression, and 3) guaranteed convergence to a stationary point or a Karush-Kuhn-Tucker point. The advantages of the proposed algorithm are also illustrated numerically.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑