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

面向大规模最大-最小公平多组多播波束成形的快速一阶算法

Fast First-Order Algorithm for Large-Scale Max-Min Fair Multi-Group Multicast Beamforming

Chong Zhang, Min Dong, Ben Liang

AI总结:

本文利用最优多播波束成形结构将大规模加权MMF问题转化为弱凸的最小-最大权重问题,并提出具有闭式更新、有限时间收敛至近稳定点的PSA快速算法,以低复杂度实现近最优性能。

摘要:

我们针对大规模系统中的加权最大-最小公平(MMF)多组多播波束成形问题,提出了一种一阶快速算法。利用近期获得的最优多播波束成形结构,我们将非凸的MMF问题转化为一个最小-最大权重最小化问题,并证明其为弱凸问题。我们提出采用投影次梯度算法(PSA)直接求解该问题,而不是使用需要迭代求解其逆问题的传统方法。我们证明,针对该问题的PSA具有闭式更新,因此计算成本较低。此外,PSA可在有限时间内收敛到该问题的近稳定点。仿真结果表明,与现有方法相比,我们基于PSA的算法在大规模系统中能够提供近最优性能,同时计算复杂度显著更低。

英文摘要:

We propose a first-order fast algorithm for the weighted max-min fair (MMF) multi-group multicast beamforming problem in large-scale systems. Utilizing the optimal multicast beamforming structure obtained recently, we convert the nonconvex MMF problem into a min-max weight minimization problem and show that it is a weakly convex problem. We propose using the projected subgradient algorithm (PSA) to solve the problem directly, instead of the conventional method that requires iteratively solving its inverse problem. We show that PSA for our problem has closed-form updates and thus is computationally cheap. Furthermore, PSA converges to a near-stationary point of our problem within finite time. Simulation results show that our PSA-based algorithm offers near-optimal performance with considerably lower computational complexity than existing methods for large-scale systems.

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

↑