Cellular, Cell-less, and Everything in Between: A Unified Framework for Utility Region Analysis in Wireless Networks

Renato Luis Garrido Cavalcante; Slawomir Stanczak; Tomasz Piotrowski

arxiv: 2507.23707 · v6 · submitted 2025-07-31 · 📡 eess.SP · cs.IT· math.IT

Cellular, Cell-less, and Everything in Between: A Unified Framework for Utility Region Analysis in Wireless Networks

Renato Luis Garrido Cavalcante , Tomasz Piotrowski , Slawomir Stanczak This is my paper

Pith reviewed 2026-05-19 02:22 UTC · model grok-4.3

classification 📡 eess.SP cs.ITmath.IT

keywords utility regionsspectral radiusnonlinear mappingswireless networksSINRachievable ratesconvexityPareto boundary

0 comments

The pith

Spectral radius of nonlinear mappings characterizes feasible utility regions in wireless networks.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes a unified framework for analyzing utility regions in wireless networks by focusing on SINR and achievable rate regions across architectures like extremely large MIMO and cell-less networks. It shows that the spectral radius of nonlinear mappings provides a simple way to characterize these feasible regions. This approach generalizes previous work on the weak Pareto boundary and yields sufficient conditions to determine when the regions are convex. A reader would care because convexity ensures that time sharing does not improve all users' utilities at once and makes certain optimization problems convex.

Core claim

The central claim is that feasible utility regions in wireless networks can be characterized using the spectral radius of nonlinear mappings. This characterization generalizes existing descriptions of the weak Pareto boundary in compact form and supplies tractable sufficient conditions for convexity of the utility regions. Convexity on the weak Pareto boundary means time sharing cannot improve all users simultaneously, identifies convex weighted sum-rate maximization problems, and supports formulating such problems directly with rates instead of SINR values.

What carries the argument

The spectral radius of nonlinear mappings that represent interference patterns and utility functions in the network.

If this is right

It generalizes existing characterizations of the weak Pareto boundary using compact notation.
It derives tractable sufficient conditions for identifying convex utility regions.
It identifies a family of weighted sum-rate maximization problems that are convex.
It justifies formulating sum-rate maximization problems in terms of achievable rates rather than SINR levels.
It motivates an alternative concept to favorable propagation in massive MIMO that accounts for self-interference and beamforming strategy.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Designers of cell-less networks could use this spectral radius test to verify convexity without exhaustive computation of the full region.
The framework unifies analysis for a continuum of architectures from cellular to fully cell-less, suggesting it may apply to hybrid deployments as well.
These conditions could guide the choice of beamforming strategies to achieve desired convexity properties in practical systems.

Load-bearing premise

The interference patterns and utility mappings in modern wireless networks can be represented by nonlinear mappings whose spectral radius directly determines the feasible utility regions and convexity properties.

What would settle it

For a concrete wireless interference scenario modeled by a nonlinear mapping, calculate its spectral radius and check if it accurately predicts the boundary and convexity of the computed feasible utility region; any mismatch would falsify the characterization.

Figures

Figures reproduced from arXiv: 2507.23707 by Renato Luis Garrido Cavalcante, Slawomir Stanczak, Tomasz Piotrowski.

**Figure 1.** Figure 1: , which shows a feasible utility (e.g., rate) region SP . 2Another common optimization criterion is sum-rate maximization, which can also be characterized as a solution to a problem of the form in (2) for appropriately chosen weights. However, finding weights leading to a power vector maximizing the sum rate is itself a challenging problem if the achievable rate region is nonconvex [PITH_FULL_IMAGE:figure… view at source ↗

**Figure 2.** Figure 2: illustrates results for a sample user placement scenario where all matrices (M+uat n )n∈N described in Example 3 are inverse Z-matrices. These figures indicate convexity of SINR - User 1 0.0 0.5 1.0 1.5 2.0 SINR - User 2 0.0 0.5 1.0 1.5 2.0 2.5 SINR - User 3 0.00 0.25 0.50 0.75 1.00 1.25 1.50 1.75 (a) SINR Rate [bit/s/Hz] - User 1 0.00 0.25 0.50 0.75 1.00 1.25 1.50 1.75 Rate [bit/s/Hz] - User 2 0.000.250.… view at source ↗

**Figure 3.** Figure 3: Sample points on weak Pareto boundary when the conditions of Corollary 2 are not satisfied. the feasible rate and SINR regions, which is in agreement with the results in Corollary 2 [PITH_FULL_IMAGE:figures/full_fig_p013_3.png] view at source ↗

read the original abstract

We introduce a unified framework for analyzing utility regions of wireless networks, with a focus on signal-to-interference-plus-noise-ratio (SINR) and achievable rate regions. The framework provides valuable insights into interference patterns of modern network architectures, including extremely large MIMO and cell-less networks. A central contribution is a simple characterization of feasible utility regions using the concept of spectral radius of nonlinear mappings. This characterization provides a powerful mathematical tool for wireless system design and analysis. For example, it allows us to generalize existing characterizations of the weak Pareto boundary using compact notation. It also allows us to derive tractable sufficient conditions for the identification of convex utility regions. This property is particularly important because, on the weak Pareto boundary, it guarantees that time sharing (or user grouping) cannot simultaneously improve the utilities of all users. Beyond geometrical insights, these sufficient conditions have two key implications. First, they identify a family of (weighted) sum-rate maximization problems that are inherently convex, thus paving the way for the development of efficient, provably optimal solvers for this family. Second, they provide justification for formulating sum-rate maximization problems directly in terms of achievable rates, rather than SINR levels. Our theoretical insights also motivate an alternative to the concept of favorable propagation in the massive MIMO literature -- one that explicitly accounts for self-interference and the beamforming strategy.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper gives a spectral radius characterization of utility regions that generalizes some Pareto boundary results and flags convex sum-rate cases, but the rate claims rest on mapping properties that need explicit checks.

read the letter

The punchline is that this paper gives a spectral radius based way to characterize feasible utility regions in wireless networks. It generalizes some existing Pareto boundary results and identifies when sum-rate problems are convex. What stands out is the unified treatment from cellular to cell-less and extremely large MIMO. The framework uses nonlinear mappings and their spectral radius to describe the regions in a compact way. This lets them extend prior characterizations and derive conditions under which the utility region is convex. Convexity matters because it means time-sharing won't help all users at once on the boundary. They also point out that this justifies optimizing rates directly instead of SINR, and suggest rethinking favorable propagation to account for self-interference. The potential issue is in the rate utilities. Interference function theory requires positive, monotone, scalable maps for the spectral radius to work as a feasibility threshold. SINR maps often fit, but rates use log(1 + SINR), which keeps monotonicity but can lose scalability with self-interference or advanced beamforming. The paper claims this covers modern networks, so I assume they verify the properties hold after composition. If the derivations show that, fine; if it's assumed without check, that's a gap to flag. Readers working on optimization in 5G and 6G systems or on theoretical analysis of interference would get the most from this. It is the kind of paper that deserves a serious referee because the framework is new and the implications for convex solvers are concrete, even if some assumptions on the mappings need tightening in review. I recommend putting it through peer review.

Referee Report

1 major / 2 minor

Summary. The paper introduces a unified framework for analyzing utility regions in wireless networks, covering cellular, cell-less, and hybrid architectures. It focuses on SINR and achievable rate regions, providing a characterization of feasible utility regions via the spectral radius of nonlinear mappings. This is used to generalize weak Pareto boundary characterizations in compact notation, derive sufficient conditions for convexity of utility regions (ensuring time-sharing cannot improve all utilities on the boundary), identify families of convex weighted sum-rate maximization problems, justify direct rate-based formulations, and motivate an alternative to favorable propagation that accounts for self-interference and beamforming.

Significance. If the spectral-radius characterization is rigorously established for both SINR and rate utilities across the considered architectures, the framework would offer a compact, general tool for interference analysis and optimization in modern systems such as XL-MIMO and cell-less networks. The convexity conditions and their implications for provably optimal solvers represent a potentially useful contribution, provided they rest on verified properties of the underlying mappings rather than post-hoc assumptions.

major comments (1)

[Sections on rate utility mappings and spectral-radius characterization] The central claim relies on representing rate utilities via a nonlinear mapping whose spectral radius determines the feasible region and convexity. Standard interference-function theory requires the mapping to be positive, monotone, and scalable. Composing the SINR mapping with the concave log(1 + ·) function preserves monotonicity but can violate scalability when self-interference or joint beamforming is present (as in cell-less/XL-MIMO settings). The manuscript must explicitly verify these axioms for the rate mapping in the relevant derivations; without this, the spectral-radius threshold does not directly bound the rate region or guarantee the stated convexity properties.

minor comments (2)

Clarify the precise definition of the nonlinear mapping for rates versus SINR, including how self-interference terms are incorporated.
Provide explicit examples or numerical checks confirming that the sufficient conditions for convexity hold in at least one cell-less or XL-MIMO scenario.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their thorough review and constructive feedback on our manuscript. We have addressed the major comment as follows and will incorporate the necessary clarifications in the revised version.

read point-by-point responses

Referee: [Sections on rate utility mappings and spectral-radius characterization] The central claim relies on representing rate utilities via a nonlinear mapping whose spectral radius determines the feasible region and convexity. Standard interference-function theory requires the mapping to be positive, monotone, and scalable. Composing the SINR mapping with the concave log(1 + ·) function preserves monotonicity but can violate scalability when self-interference or joint beamforming is present (as in cell-less/XL-MIMO settings). The manuscript must explicitly verify these axioms for the rate mapping in the relevant derivations; without this, the spectral-radius threshold does not directly bound the rate region or guarantee the stated convexity properties.

Authors: We appreciate the referee's observation regarding the verification of interference function axioms for the rate utility mapping. In the manuscript, the spectral radius characterization is derived based on the properties of the underlying mappings, and we have ensured monotonicity is preserved under the log(1+·) composition. However, to address the potential violation of scalability in scenarios involving self-interference and joint beamforming, we will add explicit verification in the revised manuscript. Specifically, we will include a dedicated paragraph or subsection in the sections on rate utility mappings that checks the positive, monotone, and scalable properties for each architecture considered (cellular, cell-less, and hybrid). This verification will demonstrate that the conditions hold under the beamforming strategies analyzed, thereby rigorously supporting the spectral-radius threshold for bounding the rate region and the convexity properties. We believe this addition will strengthen the central claim without altering the main results. revision: yes

Circularity Check

0 steps flagged

No circularity: spectral radius characterization applies standard nonlinear analysis to network mappings without self-referential reduction

full rationale

The paper's central contribution is a characterization of feasible utility regions via the spectral radius of nonlinear mappings representing SINR and rate utilities. This builds on established interference function theory (e.g., Yates) by applying monotonicity and scalability properties to derive convexity conditions and weak Pareto boundary generalizations. No step reduces a prediction to a fitted parameter by construction, nor does any load-bearing premise collapse to a self-citation whose validity depends on the current work. The framework derives tractable sufficient conditions for convex regions from mapping axioms without smuggling ansatzes or renaming known empirical patterns as novel unifications. The derivation remains self-contained and externally falsifiable via standard fixed-point theory.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The framework rests on standard mathematical properties of spectral radius applied to interference models; no free parameters, new entities, or ad-hoc axioms are mentioned in the abstract.

axioms (1)

domain assumption Interference patterns in wireless networks can be modeled by nonlinear mappings whose spectral radius determines feasible utility regions.
This modeling choice underpins the central characterization and convexity conditions.

pith-pipeline@v0.9.0 · 5786 in / 1323 out tokens · 81080 ms · 2026-05-19T02:22:54.517135+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

A central contribution is a simple characterization of feasible utility regions using the concept of spectral radius of nonlinear mappings... ρ(diag(s)T∥·∥) ≤ 1
IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

If the interference matrix M is an inverse Z-matrix, then... the SINR region S is convex

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

40 extracted references · 40 canonical work pages · 1 internal anchor

[1]

Contraction approach to power control, with non- monotonic applications,

C. J. Nuzman, “Contraction approach to power control, with non- monotonic applications,” in IEEE GLOBECOM 2007-IEEE Global Telecommunications Conference. IEEE, 2007, pp. 5283–5287

work page 2007
[3]

C. W. Tan, Wireless Network Optimization by Perron-Frobenius Theory. Now Publishers Inc, 2015

work page 2015
[4]

Closed-form max-min power control for some cellular and cell- free massive MIMO networks,

L. Miretti, R. L. Cavalcante, S. Sta ´nczak, M. Schubert, R. B ¨ohnke, and W. Xu, “Closed-form max-min power control for some cellular and cell- free massive MIMO networks,” in2022 IEEE 95th Vehicular Technology Conference:(VTC2022-Spring). IEEE, 2022, pp. 1–7

work page 2022
[5]

Transformer-based power optimization for max-min fairness in cell-free massive MIMO,

I. Chafaa, G. Bacci, and L. Sanguinetti, “Transformer-based power optimization for max-min fairness in cell-free massive MIMO,” IEEE Wireless Communications Letters, 2025, accepted for publication

work page 2025
[6]

Foundations of user- centric cell-free massive MIMO,

¨O. T. Demir, E. Bj ¨ornson, and L. Sanguinetti, “Foundations of user- centric cell-free massive MIMO,” Foundations and Trends in Signal Processing, vol. 14, pp. 162–472, 2021

work page 2021
[7]

T. L. Marzetta, E. G. Larsson, H. Yang, and H. Q. Ngo, Fundamentals of Massive MIMO . Cambridge University Press, 2016

work page 2016
[8]

Massive MIMO networks: Spectral, energy, and hardware efficiency,

E. Bj ¨ornson, J. Hoydis, and L. Sanguinetti, “Massive MIMO networks: Spectral, energy, and hardware efficiency,” Foundations and Trends® in Signal Processing, vol. 11, no. 3-4, pp. 154–655, 2017

work page 2017
[9]

Maximizing sum rate and minimizing MSE on multiuser downlink: Optimality, fast algorithms and equivalence via max-min SINR,

C. W. Tan, M. Chiang, and R. Srikant, “Maximizing sum rate and minimizing MSE on multiuser downlink: Optimality, fast algorithms and equivalence via max-min SINR,” IEEE Transactions on Signal Processing, vol. 59, no. 12, pp. 6127–6143, 2011

work page 2011
[10]

Nonnegative matrix inequalities and their application to nonconvex power control optimization,

C. W. Tan, S. Friedland, and S. Low, “Nonnegative matrix inequalities and their application to nonconvex power control optimization,” SIAM Journal on Matrix Analysis and Applications , vol. 32, no. 3, pp. 1030– 1055, 2011

work page 2011
[11]

Maximizing sum rates in cognitive radio networks: Convex relaxation and global optimization algorithms,

L. Zheng and C. W. Tan, “Maximizing sum rates in cognitive radio networks: Convex relaxation and global optimization algorithms,” IEEE Journal on Selected Areas in Communications , vol. 32, no. 3, pp. 667– 680, 2013

work page 2013
[12]

Optimal pilot and payload power control in single-cell massive MIMO systems,

H. V . Cheng, E. Bj ¨ornson, and E. G. Larsson, “Optimal pilot and payload power control in single-cell massive MIMO systems,” IEEE Transactions on Signal Processing, vol. 65, no. 9, pp. 2363–2378, 2016

work page 2016
[13]

Sta ´nczak, M

S. Sta ´nczak, M. Wiczanowski, and H. Boche, Fundamentals of Resource Allocation in Wireless Networks , 2nd ed., ser. Foundations in Signal Processing, Communications and Networking, W. Utschick, H. Boche, and R. Mathar, Eds. Berlin Heidelberg: Springer, 2009

work page 2009
[14]

Dynamic spectrum management: Complexity and duality,

Z.-Q. Luo and S. Zhang, “Dynamic spectrum management: Complexity and duality,”IEEE journal of selected topics in signal processing, vol. 2, no. 1, pp. 57–73, 2008

work page 2008
[15]

Two-timescale weighted sum- rate maximization for large cellular and cell-free massive MIMO,

L. Miretti, E. Bj ¨ornson, and S. Sta ´nczak, “Two-timescale weighted sum- rate maximization for large cellular and cell-free massive MIMO,” in 2024 IEEE 25th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC). IEEE, 2024, pp. 656–660

work page 2024
[16]

A unifying approach to interference mod- eling for wireless networks,

H. Boche and M. Schubert, “A unifying approach to interference mod- eling for wireless networks,” IEEE Transactions on Signal Processing , vol. 58, no. 6, pp. 3282–3297, 2010

work page 2010
[17]

Concave and convex interference functions – general charac- terizations and applications,

——, “Concave and convex interference functions – general charac- terizations and applications,” IEEE Transactions on Signal Processing , vol. 56, no. 10, pp. 4951–4965, 2008

work page 2008
[18]

Schubert and H

M. Schubert and H. Boche, Interference Calculus - A General Frame- work for Interference Management and Network Utility Optimization . Berlin: Springer, 2011

work page 2011
[19]

The fixed point iteration of positive concave mappings converges geometrically if a fixed point exists: Implications to wireless systems,

T. Piotrowski and R. L. G. Cavalcante, “The fixed point iteration of positive concave mappings converges geometrically if a fixed point exists: Implications to wireless systems,” IEEE Transactions on Signal Processing, vol. 70, pp. 4697–4710, 2022

work page 2022
[20]

Characterization of the weak Pareto boundary of resource allocation problems in wireless networks–implications to cell-less systems,

R. L. G. Cavalcante, L. Miretti, and S. Sta ´nczak, “Characterization of the weak Pareto boundary of resource allocation problems in wireless networks–implications to cell-less systems,” in IEEE International Con- ference on Communications (ICC) . IEEE, 2023, pp. 5010–5016

work page 2023
[21]

Two-timescale joint power control and beamforming design with applications to cell-free massive MIMO,

L. Miretti, R. L. Cavalcante, and S. Sta ´nczak, “Two-timescale joint power control and beamforming design with applications to cell-free massive MIMO,”IEEE Transactions on Wireless Communications, 2025, to appear

work page 2025
[22]

A framework for uplink power control in cellular radio systems,

R. D. Yates, “A framework for uplink power control in cellular radio systems,” IEEE J. Select. Areas Commun. , vol. 13, no. 7, pp. pp. 1341– 1348, Sept. 1995

work page 1995
[23]

Connections between spectral properties of asymptotic mappings and solutions to wireless network problems,

R. L. G. Cavalcante, Q. Liao, and S. Sta ´nczak, “Connections between spectral properties of asymptotic mappings and solutions to wireless network problems,” IEEE Transactions on Signal Processing , vol. 67, no. 10, pp. 2747–2760, 2019

work page 2019
[24]

On the convexity of feasible QoS regions,

S. Stanczak and H. Boche, “On the convexity of feasible QoS regions,” IEEE Transactions on Information Theory , vol. 53, no. 2, pp. 779–783, 2007

work page 2007
[25]

When is the achievable rate region convex in two-user massive MIMO systems?

Z. Chen, E. Bj ¨ornson, and E. G. Larsson, “When is the achievable rate region convex in two-user massive MIMO systems?” IEEE Wireless Communications Letters, vol. 7, no. 5, pp. 796–799, 2018

work page 2018
[26]

Maximizing sum rates in Gaussian interference-limited channels,

C. Tan, S. Friedland, and S. Low, “Maximizing sum rates in Gaussian interference-limited channels,” SIAM J. Matrix Anal. Appl , vol. 32, pp. 1030–1055, 2011

work page 2011
[27]

Optimality certificate of dynamic spectrum management in multi-carrier interfer- ence channels,

P. Tsiaflakis, C. W. Tan, Y . Yi, M. Chiang, and M. Moonen, “Optimality certificate of dynamic spectrum management in multi-carrier interfer- ence channels,” in 2008 IEEE International Symposium on Information Theory. IEEE, 2008, pp. 1298–1302

work page 2008
[28]

Convex spectral functions,

S. Friedland, “Convex spectral functions,” Linear and multilinear alge- bra, vol. 9, no. 4, pp. 299–316, 1981

work page 1981
[29]

Convexity and log convexity for the spectral radius,

R. D. Nussbaum, “Convexity and log convexity for the spectral radius,” Linear Algebra and its Applications , vol. 73, pp. 59–122, 1986

work page 1986
[30]

Inverse M-matrices, ii,

C. R. Johnson and R. L. Smith, “Inverse M-matrices, ii,” Linear algebra and its applications , vol. 435, no. 5, pp. 953–983, 2011

work page 2011
[31]

Elementary properties of positive concave mappings with applications to network planning and optimization,

R. L. G. Cavalcante, Y . Shen, and S. Sta ´nczak, “Elementary properties of positive concave mappings with applications to network planning and optimization,” IEEE Trans. Signal Processing, vol. 64, no. 7, pp. 1774– 1873, April 2016

work page 2016
[32]

Perron–Frobenius problem for weakly sublinear maps in a Euclidean positive orthant,

Y . Oshime, “Perron–Frobenius problem for weakly sublinear maps in a Euclidean positive orthant,” Japan journal of industrial and applied mathematics, vol. 9, no. 2, p. 313, 1992

work page 1992
[33]

Lemmens and R

B. Lemmens and R. Nussbaum, Nonlinear Perron-Frobenius theory . Cambridge, UK: Cambridge University Press, 2012

work page 2012
[34]

Concave Perron–Frobenius theory and applications,

U. Krause, “Concave Perron–Frobenius theory and applications,” Non- linear Analysis: Theory, Methods & Applications , vol. 47, no. 3, pp. 1457–1466, 2001

work page 2001
[35]

Fundamental properties of solutions to utility maximization problems in wireless networks

R. L. G. Cavalcante and S. Sta ´nczak, “Fundamental properties of solutions to utility maximization problems,” in arXiv:1610.01988, 2016

work page internal anchor Pith review Pith/arXiv arXiv 2016
[36]

A general duality theory for uplink and downlink beamforming,

H. Boche and M. Schubert, “A general duality theory for uplink and downlink beamforming,” in Proceedings IEEE 56th Vehicular Technol- ogy Conference, vol. 1. IEEE, 2002, pp. 87–91

work page 2002
[37]

UL-DL duality for cell-free massive MIMO with per-AP power and information constraints,

L. Miretti, R. L. G. Cavalcante, E. Bj ¨ornson, and S. Sta ´nczak, “UL-DL duality for cell-free massive MIMO with per-AP power and information constraints,” IEEE Transactions on Signal Processing , 2024

work page 2024
[38]

H. H. Bauschke and P. L. Combettes, Convex Analysis and Monotone Operator Theory in Hilbert Spaces , 2nd ed. Springer, 2017

work page 2017
[39]

Elementary properties of positive concave mappings with applications to network planning and optimization,

R. L. G. Cavalcante, Y . Shen, and S. Sta ´nczak, “Elementary properties of positive concave mappings with applications to network planning and optimization,” IEEE Transactions on Signal Processing , vol. 64, no. 7, pp. 1774–1783, April 2016

work page 2016
[40]

Boyd and L

S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2006

work page 2006
[41]

Zalinescu, Convex analysis in general vector spaces

C. Zalinescu, Convex analysis in general vector spaces . World scientific, 2002. 15 SUPPLEMENTAL MATERIAL Below, we collect well-known results from the literature that serve as key components in the proofs presented in our study. Fact 1. [30, Theorem 2.9.2] A nonnegative matrix M ∈ RN ×N + is an inverse Z-matrix for N = 2 if and only if det(M) > 0. Fact 2...

work page 2002

[1] [1]

Contraction approach to power control, with non- monotonic applications,

C. J. Nuzman, “Contraction approach to power control, with non- monotonic applications,” in IEEE GLOBECOM 2007-IEEE Global Telecommunications Conference. IEEE, 2007, pp. 5283–5287

work page 2007

[2] [3]

C. W. Tan, Wireless Network Optimization by Perron-Frobenius Theory. Now Publishers Inc, 2015

work page 2015

[3] [4]

Closed-form max-min power control for some cellular and cell- free massive MIMO networks,

L. Miretti, R. L. Cavalcante, S. Sta ´nczak, M. Schubert, R. B ¨ohnke, and W. Xu, “Closed-form max-min power control for some cellular and cell- free massive MIMO networks,” in2022 IEEE 95th Vehicular Technology Conference:(VTC2022-Spring). IEEE, 2022, pp. 1–7

work page 2022

[4] [5]

Transformer-based power optimization for max-min fairness in cell-free massive MIMO,

I. Chafaa, G. Bacci, and L. Sanguinetti, “Transformer-based power optimization for max-min fairness in cell-free massive MIMO,” IEEE Wireless Communications Letters, 2025, accepted for publication

work page 2025

[5] [6]

Foundations of user- centric cell-free massive MIMO,

¨O. T. Demir, E. Bj ¨ornson, and L. Sanguinetti, “Foundations of user- centric cell-free massive MIMO,” Foundations and Trends in Signal Processing, vol. 14, pp. 162–472, 2021

work page 2021

[6] [7]

T. L. Marzetta, E. G. Larsson, H. Yang, and H. Q. Ngo, Fundamentals of Massive MIMO . Cambridge University Press, 2016

work page 2016

[7] [8]

Massive MIMO networks: Spectral, energy, and hardware efficiency,

E. Bj ¨ornson, J. Hoydis, and L. Sanguinetti, “Massive MIMO networks: Spectral, energy, and hardware efficiency,” Foundations and Trends® in Signal Processing, vol. 11, no. 3-4, pp. 154–655, 2017

work page 2017

[8] [9]

Maximizing sum rate and minimizing MSE on multiuser downlink: Optimality, fast algorithms and equivalence via max-min SINR,

C. W. Tan, M. Chiang, and R. Srikant, “Maximizing sum rate and minimizing MSE on multiuser downlink: Optimality, fast algorithms and equivalence via max-min SINR,” IEEE Transactions on Signal Processing, vol. 59, no. 12, pp. 6127–6143, 2011

work page 2011

[9] [10]

Nonnegative matrix inequalities and their application to nonconvex power control optimization,

C. W. Tan, S. Friedland, and S. Low, “Nonnegative matrix inequalities and their application to nonconvex power control optimization,” SIAM Journal on Matrix Analysis and Applications , vol. 32, no. 3, pp. 1030– 1055, 2011

work page 2011

[10] [11]

Maximizing sum rates in cognitive radio networks: Convex relaxation and global optimization algorithms,

L. Zheng and C. W. Tan, “Maximizing sum rates in cognitive radio networks: Convex relaxation and global optimization algorithms,” IEEE Journal on Selected Areas in Communications , vol. 32, no. 3, pp. 667– 680, 2013

work page 2013

[11] [12]

Optimal pilot and payload power control in single-cell massive MIMO systems,

H. V . Cheng, E. Bj ¨ornson, and E. G. Larsson, “Optimal pilot and payload power control in single-cell massive MIMO systems,” IEEE Transactions on Signal Processing, vol. 65, no. 9, pp. 2363–2378, 2016

work page 2016

[12] [13]

Sta ´nczak, M

S. Sta ´nczak, M. Wiczanowski, and H. Boche, Fundamentals of Resource Allocation in Wireless Networks , 2nd ed., ser. Foundations in Signal Processing, Communications and Networking, W. Utschick, H. Boche, and R. Mathar, Eds. Berlin Heidelberg: Springer, 2009

work page 2009

[13] [14]

Dynamic spectrum management: Complexity and duality,

Z.-Q. Luo and S. Zhang, “Dynamic spectrum management: Complexity and duality,”IEEE journal of selected topics in signal processing, vol. 2, no. 1, pp. 57–73, 2008

work page 2008

[14] [15]

Two-timescale weighted sum- rate maximization for large cellular and cell-free massive MIMO,

L. Miretti, E. Bj ¨ornson, and S. Sta ´nczak, “Two-timescale weighted sum- rate maximization for large cellular and cell-free massive MIMO,” in 2024 IEEE 25th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC). IEEE, 2024, pp. 656–660

work page 2024

[15] [16]

A unifying approach to interference mod- eling for wireless networks,

H. Boche and M. Schubert, “A unifying approach to interference mod- eling for wireless networks,” IEEE Transactions on Signal Processing , vol. 58, no. 6, pp. 3282–3297, 2010

work page 2010

[16] [17]

Concave and convex interference functions – general charac- terizations and applications,

——, “Concave and convex interference functions – general charac- terizations and applications,” IEEE Transactions on Signal Processing , vol. 56, no. 10, pp. 4951–4965, 2008

work page 2008

[17] [18]

Schubert and H

M. Schubert and H. Boche, Interference Calculus - A General Frame- work for Interference Management and Network Utility Optimization . Berlin: Springer, 2011

work page 2011

[18] [19]

The fixed point iteration of positive concave mappings converges geometrically if a fixed point exists: Implications to wireless systems,

T. Piotrowski and R. L. G. Cavalcante, “The fixed point iteration of positive concave mappings converges geometrically if a fixed point exists: Implications to wireless systems,” IEEE Transactions on Signal Processing, vol. 70, pp. 4697–4710, 2022

work page 2022

[19] [20]

Characterization of the weak Pareto boundary of resource allocation problems in wireless networks–implications to cell-less systems,

R. L. G. Cavalcante, L. Miretti, and S. Sta ´nczak, “Characterization of the weak Pareto boundary of resource allocation problems in wireless networks–implications to cell-less systems,” in IEEE International Con- ference on Communications (ICC) . IEEE, 2023, pp. 5010–5016

work page 2023

[20] [21]

Two-timescale joint power control and beamforming design with applications to cell-free massive MIMO,

L. Miretti, R. L. Cavalcante, and S. Sta ´nczak, “Two-timescale joint power control and beamforming design with applications to cell-free massive MIMO,”IEEE Transactions on Wireless Communications, 2025, to appear

work page 2025

[21] [22]

A framework for uplink power control in cellular radio systems,

R. D. Yates, “A framework for uplink power control in cellular radio systems,” IEEE J. Select. Areas Commun. , vol. 13, no. 7, pp. pp. 1341– 1348, Sept. 1995

work page 1995

[22] [23]

Connections between spectral properties of asymptotic mappings and solutions to wireless network problems,

R. L. G. Cavalcante, Q. Liao, and S. Sta ´nczak, “Connections between spectral properties of asymptotic mappings and solutions to wireless network problems,” IEEE Transactions on Signal Processing , vol. 67, no. 10, pp. 2747–2760, 2019

work page 2019

[23] [24]

On the convexity of feasible QoS regions,

S. Stanczak and H. Boche, “On the convexity of feasible QoS regions,” IEEE Transactions on Information Theory , vol. 53, no. 2, pp. 779–783, 2007

work page 2007

[24] [25]

When is the achievable rate region convex in two-user massive MIMO systems?

Z. Chen, E. Bj ¨ornson, and E. G. Larsson, “When is the achievable rate region convex in two-user massive MIMO systems?” IEEE Wireless Communications Letters, vol. 7, no. 5, pp. 796–799, 2018

work page 2018

[25] [26]

Maximizing sum rates in Gaussian interference-limited channels,

C. Tan, S. Friedland, and S. Low, “Maximizing sum rates in Gaussian interference-limited channels,” SIAM J. Matrix Anal. Appl , vol. 32, pp. 1030–1055, 2011

work page 2011

[26] [27]

Optimality certificate of dynamic spectrum management in multi-carrier interfer- ence channels,

P. Tsiaflakis, C. W. Tan, Y . Yi, M. Chiang, and M. Moonen, “Optimality certificate of dynamic spectrum management in multi-carrier interfer- ence channels,” in 2008 IEEE International Symposium on Information Theory. IEEE, 2008, pp. 1298–1302

work page 2008

[27] [28]

Convex spectral functions,

S. Friedland, “Convex spectral functions,” Linear and multilinear alge- bra, vol. 9, no. 4, pp. 299–316, 1981

work page 1981

[28] [29]

Convexity and log convexity for the spectral radius,

R. D. Nussbaum, “Convexity and log convexity for the spectral radius,” Linear Algebra and its Applications , vol. 73, pp. 59–122, 1986

work page 1986

[29] [30]

Inverse M-matrices, ii,

C. R. Johnson and R. L. Smith, “Inverse M-matrices, ii,” Linear algebra and its applications , vol. 435, no. 5, pp. 953–983, 2011

work page 2011

[30] [31]

Elementary properties of positive concave mappings with applications to network planning and optimization,

R. L. G. Cavalcante, Y . Shen, and S. Sta ´nczak, “Elementary properties of positive concave mappings with applications to network planning and optimization,” IEEE Trans. Signal Processing, vol. 64, no. 7, pp. 1774– 1873, April 2016

work page 2016

[31] [32]

Perron–Frobenius problem for weakly sublinear maps in a Euclidean positive orthant,

Y . Oshime, “Perron–Frobenius problem for weakly sublinear maps in a Euclidean positive orthant,” Japan journal of industrial and applied mathematics, vol. 9, no. 2, p. 313, 1992

work page 1992

[32] [33]

Lemmens and R

B. Lemmens and R. Nussbaum, Nonlinear Perron-Frobenius theory . Cambridge, UK: Cambridge University Press, 2012

work page 2012

[33] [34]

Concave Perron–Frobenius theory and applications,

U. Krause, “Concave Perron–Frobenius theory and applications,” Non- linear Analysis: Theory, Methods & Applications , vol. 47, no. 3, pp. 1457–1466, 2001

work page 2001

[34] [35]

Fundamental properties of solutions to utility maximization problems in wireless networks

R. L. G. Cavalcante and S. Sta ´nczak, “Fundamental properties of solutions to utility maximization problems,” in arXiv:1610.01988, 2016

work page internal anchor Pith review Pith/arXiv arXiv 2016

[35] [36]

A general duality theory for uplink and downlink beamforming,

H. Boche and M. Schubert, “A general duality theory for uplink and downlink beamforming,” in Proceedings IEEE 56th Vehicular Technol- ogy Conference, vol. 1. IEEE, 2002, pp. 87–91

work page 2002

[36] [37]

UL-DL duality for cell-free massive MIMO with per-AP power and information constraints,

L. Miretti, R. L. G. Cavalcante, E. Bj ¨ornson, and S. Sta ´nczak, “UL-DL duality for cell-free massive MIMO with per-AP power and information constraints,” IEEE Transactions on Signal Processing , 2024

work page 2024

[37] [38]

H. H. Bauschke and P. L. Combettes, Convex Analysis and Monotone Operator Theory in Hilbert Spaces , 2nd ed. Springer, 2017

work page 2017

[38] [39]

Elementary properties of positive concave mappings with applications to network planning and optimization,

R. L. G. Cavalcante, Y . Shen, and S. Sta ´nczak, “Elementary properties of positive concave mappings with applications to network planning and optimization,” IEEE Transactions on Signal Processing , vol. 64, no. 7, pp. 1774–1783, April 2016

work page 2016

[39] [40]

Boyd and L

S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2006

work page 2006

[40] [41]

Zalinescu, Convex analysis in general vector spaces

C. Zalinescu, Convex analysis in general vector spaces . World scientific, 2002. 15 SUPPLEMENTAL MATERIAL Below, we collect well-known results from the literature that serve as key components in the proofs presented in our study. Fact 1. [30, Theorem 2.9.2] A nonnegative matrix M ∈ RN ×N + is an inverse Z-matrix for N = 2 if and only if det(M) > 0. Fact 2...

work page 2002