Spectral-NFP: Certified Low-Rank Curvature Majorization for Accelerating WMMSE

2026-09-23

AI Summary

本文提出Spectral-NFP方法，通过保留主要曲率特征对并使用缩放单位矩阵来加速WMMSE算法，解决了多单元MIMO网络中加权和速率最大化问题的高计算成本。

Abstract

Weighted sum-rate maximization in multicell multiple-input multiple-output (MIMO) networks is commonly addressed by the weighted minimum mean-square error (WMMSE) algorithm or fractional programming (FP), both of which, after fixing their auxiliary variables, solve a power-constrained quadratic transmit problem that requires costly dense operations for large arrays. Replacing the underlying curvature matrix with a scaled identity can avoid the matrix inverse operation and thereby reduce complexity, but it discards the curvature eigenvalue structure and yields a loose lower bound. We propose Spectral-NFP, which retains selected dominant curvature eigenpairs and uses a scaled identity matrix to bound the curvature on the remaining subspace from above. The retained rank thus traces a continuous path from NFP to the exact WMMSE transmit update. With the surrogate curvature fixed, Spectral-NFP can be interpreted as Euclidean projected-gradient ascent after a linear coordinate transformation, admitting Nesterov-type acceleration. We derive a lower bound on the one-step transmit-objective gain of Spectral-NFP relative to WMMSE, expressed in terms of the curvature eigenvalues. Under an idealized Wishart model, we analyze this bound in both finite dimensions and the large-system limit, obtaining an asymptotic rank-selection rule. Experimental results show that retaining at most 20% of the transmit dimension, and often less than 10%, achieves more than 99% of the WMMSE WSR. In large-array settings, the measured update time is below 20% of that required by WMMSE.

Problem

• WMMSE
• MIMO Networks
• Weighted Sum-Rate Maximization

Innovation

• Spectral-NFP
• curvature majorization
• low-rank approximation
• Nesterov acceleration
• multicell MIMO