arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1610.05482cs.ITmath.IT
收藏

用于无线通信设计的圆锥二次公式

Conic Quadratic Formulations for Wireless Communications Design

Quang-Doanh Vu, Markku Juntti, Een-Kee Hong, Le-Nam Tran

摘要:

由于无线通信中的资源管理问题是非凸的,在许多情况下甚至是NP-难的,因此寻找这些问题的全局最优解并没有什么实际意义。对于更实用的方法,有丰富的文献迭代法,旨在找到一个解决方案,满足必要的最优性条件,这些问题。这些方法都是在几种类似的数学框架下推导出来的,如内近似算法、凹凸过程、优化最小化算法和逐次凸近似(SCA)。然而,大部分现有的算法到达一个相对通用的程序在每次迭代,这是计算效率较低相比,一个更标准的凸制定。本文提出了\emph{numerically efficient}转换和近似的SCA为基础的方法来处理非凸性的无线通信设计。更具体地说,中心目标是表明,在无线通信中的各种非凸问题可以迭代求解圆锥二次优化。我们重新审视各种例子来证明所提出的近似的优点。理论复杂性分析和数值结果表明,我们提出的解决方案相比,现有的计算成本方面的优越效率。

英文摘要:

As a wide class of resource management problems in wireless communications are nonconvex and even NP-hard in many cases, finding globally optimal solutions to these problems is of little practical interest. Towards more pragmatic approaches, there is a rich literature on iterative methods aiming at finding a solution satisfying necessary optimality conditions to these problems. These approaches have been derived under several similar mathematical frameworks such as inner approximation algorithm, concave-convex procedure, majorization-minimization algorithm, and successive convex approximation (SCA). However, a large portion of existing algorithms arrive at a relatively generic program at each iteration, which is less computationally efficient compared to a more standard convex formulation. This paper proposes \emph{numerically efficient} transformations and approximations for SCA-based methods to deal with nonconvexity in wireless communications design. More specifically, the central goal is to show that various nonconvex problems in wireless communications can be iteratively solved by conic quadratic optimization. We revisit various examples to demonstrate the advantages of the proposed approximations. Theoretical complexity analysis and numerical results show the superior efficiency in terms of computational cost of our proposed solutions compared to the existing ones.

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

↑