Admm-Based Fast Algorithm for Robust Multi-Group Multicast Beamforming
Niloofar Mohamadi, Min Dong, Shahram ShahbazPanahi
Abstract
We consider robust multi-group multicast beamforming design in massive multiple-input multiple-output (MIMO) large-scale systems. The goal is to minimize the transmit power subject to the minimum signal-to-interference-plus-noise-ratio (SINR) targets under channel uncertainty. Using the exact worst-case SINR constraints, we transform the problem into a non-convex optimization problem. We develop an alternating direction method of multipliers (ADMM)based fast algorithm to solve this problem directly with convergence guarantee. Our two-layer ADMM-based algorithm decomposes the non-convex problem into a sequence of convex subproblems, for which we obtain the semi-closed-form or closed-form solutions. Simulation studies show that our algorithm provides a considerable computational advantage over the conventional interior-point method non-convex solver with nearly identical performance.
BibTeX
@inproceedings{icassp2021_admmbasedfastalg,
title = {Admm-Based Fast Algorithm for Robust Multi-Group Multicast Beamforming},
author = {Niloofar Mohamadi and Min Dong and Shahram ShahbazPanahi},
booktitle = {ICASSP 2021},
year = {2021}
}