Sum-Rate Maximization via Convex Optimization Using Subgradient Projections Onto Nonlinear Spectral Radius Constraint Sets
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911467385651200 |
|---|---|
| author | Kuroda, Hiroki Cavalcante, Renato Luis Garrido |
| author_facet | Kuroda, Hiroki Cavalcante, Renato Luis Garrido |
| contents | We solve the (weighted) sum-rate maximization problem over the set of achievable rates characterized by a nonlinear spectral radius function. This set has been recently shown to be convex in some practically relevant settings in modern wireless networks, including cell-less networks. However, even under convexity, sum-rate maximization is challenging because the nonlinear spectral radius characterization of the achievable rate region is difficult to handle directly. We overcome this difficulty by exploiting subgradient projections onto the level sets of suitably reformulated spectral radius functions. Notably, the derived subgradient projection algorithm provably converges to the global optimum of the sum-rate maximization problem under the convexity condition. The efficacy of the proposed algorithm is illustrated in simulations for cell-less networks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_21592 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Sum-Rate Maximization via Convex Optimization Using Subgradient Projections Onto Nonlinear Spectral Radius Constraint Sets Kuroda, Hiroki Cavalcante, Renato Luis Garrido Optimization and Control We solve the (weighted) sum-rate maximization problem over the set of achievable rates characterized by a nonlinear spectral radius function. This set has been recently shown to be convex in some practically relevant settings in modern wireless networks, including cell-less networks. However, even under convexity, sum-rate maximization is challenging because the nonlinear spectral radius characterization of the achievable rate region is difficult to handle directly. We overcome this difficulty by exploiting subgradient projections onto the level sets of suitably reformulated spectral radius functions. Notably, the derived subgradient projection algorithm provably converges to the global optimum of the sum-rate maximization problem under the convexity condition. The efficacy of the proposed algorithm is illustrated in simulations for cell-less networks. |
| title | Sum-Rate Maximization via Convex Optimization Using Subgradient Projections Onto Nonlinear Spectral Radius Constraint Sets |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2602.21592 |