Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.23260 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915887334817792 |
|---|---|
| author | Zhu, Minhao Shen, Kaiming |
| author_facet | Zhu, Minhao Shen, Kaiming |
| contents | This paper addresses the weighted sum-rate (WSR) maximization problem in a downlink distributed antenna system subject to per-cluster power constraints. This optimization scenario presents significant challenges due to the high dimensionality of beamforming variables in dense antenna deployments and the structural complexity of multiple independent power constraints. To overcome these difficulties, we generalize the low-dimensional subspace property--previously established for sum-power constraints--to the per-cluster power constraint case. We prove that all stationary-point beamformers reside in a reduced subspace spanned by the channel vectors of the corresponding antenna cluster. Leveraging this property, we reformulate the original high-dimensional constrained problem into an unconstrained optimization task over a product of ellipsoidal manifolds, thereby achieving significant dimensionality reduction. We systematically derive the necessary Riemannian geometric structures for this specific manifold, including the tangent space, Riemannian metric, orthogonal projection, retraction, and vector transport. Subsequently, we develop a tailored Riemannian conjugate gradient algorithm to solve the reformulated problem. Numerical simulations demonstrate that the proposed algorithm achieves the same local optima as standard benchmarks, such as the weighted minimum mean square error (WMMSE) method and conventional manifold optimization, but with substantially higher computational efficiency and scalability, particularly as the number of antenna clusters increases. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_23260 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Ellipsoidal Manifold Optimization for Distributed Antenna Beamforming Zhu, Minhao Shen, Kaiming Information Theory This paper addresses the weighted sum-rate (WSR) maximization problem in a downlink distributed antenna system subject to per-cluster power constraints. This optimization scenario presents significant challenges due to the high dimensionality of beamforming variables in dense antenna deployments and the structural complexity of multiple independent power constraints. To overcome these difficulties, we generalize the low-dimensional subspace property--previously established for sum-power constraints--to the per-cluster power constraint case. We prove that all stationary-point beamformers reside in a reduced subspace spanned by the channel vectors of the corresponding antenna cluster. Leveraging this property, we reformulate the original high-dimensional constrained problem into an unconstrained optimization task over a product of ellipsoidal manifolds, thereby achieving significant dimensionality reduction. We systematically derive the necessary Riemannian geometric structures for this specific manifold, including the tangent space, Riemannian metric, orthogonal projection, retraction, and vector transport. Subsequently, we develop a tailored Riemannian conjugate gradient algorithm to solve the reformulated problem. Numerical simulations demonstrate that the proposed algorithm achieves the same local optima as standard benchmarks, such as the weighted minimum mean square error (WMMSE) method and conventional manifold optimization, but with substantially higher computational efficiency and scalability, particularly as the number of antenna clusters increases. |
| title | Ellipsoidal Manifold Optimization for Distributed Antenna Beamforming |
| topic | Information Theory |
| url | https://arxiv.org/abs/2603.23260 |