arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2305.02704cs.ITmath.IT
收藏

无线网络中的混合最大与最小分式规划

Mixed Max-and-Min Fractional Programming for Wireless Networks

Yannan Chen, Licheng Zhao, Kaiming Shen

AI总结:

针对无线网络中无法相互转换的最大与最小分式规划问题,提出统一优化框架,扩展二次变换技术,提供MM解释与拉格朗日对偶变换,并验证了在AoI最小化等三项应用中的有效性。

摘要:

分式规划(FP)在无线网络设计中起着至关重要的作用,因为许多相关问题涉及最大化或最小化比率项。注意到FP的最大化情况和最小化情况通常无法相互转换,因此在以往的大多数研究中必须分别处理。因此,现有的最大化比率FP方法通常不适用于最小化情况,反之亦然。然而,FP目标可以是混合最大与最小的,例如,人们可能希望在最大化合法接收机的信号与干扰加噪声比(SINR)的同时,最小化窃听者的SINR。我们旨在通过设计一个统一的优化框架来填补max-FP和min-FP之间的空白。主要结果有三方面。首先,我们将称为二次变换的现有max-FP技术扩展到min-FP,并进一步为混合情况开发了一个完全广义化。其次,我们为所提出的统一方法提供了一种极小化-极大化(MM)解释,从而确立了其收敛性,并获得了一个矩阵扩展;我们获得的另一个结果是一种广义拉格朗日对偶变换,它有助于求解对数FP。最后,我们提出了三个典型应用:信息年龄(AoI)最小化、用于感知的Cramer-Rao界最小化以及安全数据速率最大化,这些应用都无法通过以往的FP方法高效解决。

英文摘要:

Fractional programming (FP) plays a crucial role in wireless network design because many relevant problems involve maximizing or minimizing ratio terms. Notice that the maximization case and the minimization case of FP cannot be converted to each other in general, so they have to be dealt with separately in most of the previous studies. Thus, an existing FP method for maximizing ratios typically does not work for the minimization case, and vice versa. However, the FP objective can be mixed max-and-min, e.g., one may wish to maximize the signal-to-interference-plus-noise ratio (SINR) of the legitimate receiver while minimizing that of the eavesdropper. We aim to fill the gap between max-FP and min-FP by devising a unified optimization framework. The main results are three-fold. First, we extend the existing max-FP technique called quadratic transform to the min-FP, and further develop a full generalization for the mixed case. Second. we provide a minorization-maximization (MM) interpretation of the proposed unified approach, thereby establishing its convergence and also obtaining a matrix extension; another result we obtain is a generalized Lagrangian dual transform which facilitates the solving of the logarithmic FP. Finally, we present three typical applications: the age-of-information (AoI) minimization, the Cramer-Rao bound minimization for sensing, and the secure data rate maximization, none of which can be efficiently addressed by the previous FP methods.

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

↑