Multi-Group Multicast Beamforming by Superiorized Projections onto Convex Sets
arXiv:2102.11947 · doi:10.1109/TSP.2021.3117513
Abstract
In this paper, we propose an iterative algorithm to address the nonconvex multi-group multicast beamforming problem with quality-of-service constraints and per-antenna power constraints. We formulate a convex relaxation of the problem as a semidefinite program in a real Hilbert space, which allows us to approximate a point in the feasible set by iteratively applying a bounded perturbation resilient fixed-point mapping. Inspired by the superiorization methodology, we use this mapping as a basic algorithm, and we add in each iteration a small perturbation with the intent to reduce the objective value and the distance to nonconvex rank-constraint sets. We prove that the sequence of perturbations is bounded, so the algorithm is guaranteed to converge to a feasible point of the relaxed semidefinite program. Simulations show that the proposed approach outperforms existing algorithms in terms of both computation time and approximation gap in many cases.
References in corpus (9)
- Feasible Point Pursuit and Successive Approximation of Non-convex QCQPs
- Weighted Fair Multicast Multigroup Beamforming under Per-antenna Power Constraints
- Physical-Layer Multicasting by Stochastic Transmit Beamforming and Alamouti Space-Time Coding
- Superiorization: An optimization heuristic for medical physics
- Multicast Multigroup Beamforming for Per-antenna Power Constrained Large-scale Arrays
- Distributed Optimization for Coordinated Beamforming in Multi-Cell Multigroup Multicast Systems: Power Minimization and SINR Balancing
- Prox-regularity of rank constraint sets and implications for algorithms
- Sum Rate Maximizing Multigroup Multicast Beamforming under Per-antenna Power Constraints
- The Method of Alternating Projections