Minimax Duality for MIMO Interference Networks

A minimax duality for a Gaussian mutual information expression was introduced by Yu. An interesting observation is the relationship between cost constraints on the transmit covariances and noise covariances in the dual problem via Lagrangian multipliers. We introduce a minimax duality for general MIMO interference networks, where noise and transmit covariances are optimized subject to linear conic constraints. We observe a fully symmetric relationship between the solutions of both networks, where the roles of the optimization variables and Lagrangian multipliers are inverted. The least favorable noise covariance itself provides a Lagrangian multiplier for the linear conic constraint on the transmit covariance in the dual network, while the transmit covariance provides a Lagrangian multiplier for the constraint on the interference plus noise covariance in the dual network. The degrees of freedom available for optimization are constituted by linear subspaces, where the orthogonal subspaces induce the constraints in the dual network. For the proof of our duality we make use of the existing polite water-filling network duality and as a by-product we are able to show that maximization problems in MIMO interference networks have a zero-duality gap for a special formulation of the dual function. Our minimax duality unifies and extends several results, including the original minimax duality and other known network dualities. New results and applications are MIMO transmission strategies that manage and handle uncertainty due to unknown inter-cell interference and information theoretic proofs concerning cooperation in networks and optimality of proper signaling.


Introduction
From the literature, we know network dualities of the following three types: signal-to-interference-and-noise-ratio (SINR) dualities [1][2][3][4], mean-square-error (MSE) dualities [5][6][7], and rate dualities [4,[8][9][10][11][12].The dualities show that the region of achievable SINRs, MSEs, and rates, respectively, are the same for two networks.The most prominent and important application of network dualities is the duality of the broadcast channel (BC) and the multiple access channel (MAC) with interference (pre-)subtraction, where the dualities show that SINR, MSE, and achievable rate region are identical for Gaussian signalling.The main benefit for converting the BC problem (downlink) into the MAC (uplink) domain is that for the optimal decoding order of the users, the problem formulation obtained for the uplink can be reformulated as a convex optimization problem.
The network dualities for the BC-MAC scenario with interference (pre-)subtraction and a sum-power constraint have been extended along several directions.A more general BC-MAC duality, which also holds for linear signal processing, i.e., without non-linear interference cancellation, is introduced in [11].In [12,13], dualities for general interference networks are considered.
Furthermore, the solutions are characterized by polite-waterfilling, a result we use in the proof of our duality.While most network dualities only hold for a sum-power constraint, there are some network dualities that extended to more general constraints.Dualities for scenarios with multiple linear constraints, or per antenna power constraint as a special case, can be found in [13][14][15][16].In [10], a worst-case noise optimization is considered by a minimax duality and the connection of network duality and Lagrangian duality is revealed.Worst-case noise optimization for MIMO communications is also considered in [17,18].Minimax expressions also appear when considering the compound capacity of a MIMO channel [19,20], where the uncertainty is in the channel knowledge instead of the noise.
SINR dualities and conic optimization, for example, semidefinite programming and second order cone programming, are frequently used in the context of power minimization problems under SINR constraints, or the related max-min SINR optimization [1,21,22].Usually, transmit filters are reparameterized as rank-one matrices and relaxation of the rank-one constraint reveals a convex reformulation of the problem, where the SINR constraints become conic constraints.Note that this is very different to the linear conic constraints we use.Our result generalizes the original minimax duality by Yu [10] to a larger class of constraints and to interference networks, which contain broadcast and multiple access channels (with and without non-linear interference cancellation) as special cases.
Yu [10] introduced a minimax duality for the MIMO channel.For a channel matrix H, noise symbol covariance R, and transmit symbol covariance Q, he considers a saddle point problem of the mutual information W(R, Q) under linear constraints: The dual saddle point problem with flipped channel matrix H H , noise symbol covariance Ω, and transmit symbol covariance Σ is given by min Ω 0 max Σ 0 {W(Ω, Σ) : tr(ΣR ) ≤ λ R } : tr(ΩQ ) ≤ λ Q (2) where the constraint matrices Q , R are a solution of Equation (1) with λ Q , λ R as Lagrangian multipliers.The other way round, the constraint matrices Σ , Ω of Equation ( 1) are solution for Equation (2) with Lagrangian multipliers λ Σ = λ R , λ Ω = λ Q .By Lagrangian duality, Yu reveals the relationship between the cost constraints in one problem, the optimization variables in the dual problem, and the Lagrangian multipliers.We consider a minimax optimization of a weighted sum of the mutual informations of the links in a network, where the minimization is over the noise covariances and the maximization is with respect to the transmit covariances.The feasible sets of the covariances are modeled by linear conic constraints, i.e., the covariance matrix has to be smaller than a constraint matrix in the sense of positive-semidefiniteness. The use of the linear conic constraints is not motivated by a specific application, instead we will see that they are general enough to model a large class of constraints, including sum-power constraints, per antenna power constraints, or shaping constraints.Shaping constraints for the optimization of transmit covariances in MIMO systems are for example considered in [23][24][25][26][27].
The contributions of this paper are as follows.We introduce the downlink and uplink minimax problems under linear conic constraints and show that they not only exhibit an equal optimal value, but share a fully symmetric system of optimality conditions with inverted roles of the optimization variables and Lagrangian multipliers.The least favorable noise covariance itself provides a Lagrangian multiplier for the linear conic constraint on the transmit covariance in the dual network, while the transmit covariance provides a Lagrangian multiplier for the constraint on the interference plus noise covariance in the dual network (The idea to include the interference plus noise covariances as an optimization variable, which then appears in the optimality conditions, was independently developed in [28].Unfortunately, the current version of [28] available at arXiv contains several flaws, the most significant one being the following: The authors claim that max-min equals min-max for problem Equations ( 7)-( 9) and the solution is a saddle point.This is wrong-here is a counter example: Consider a interference network with square channels that are full rank.For the min-max version, the outer minimization over Ω results in Ω l = I ∀l which leads to Σ l = 0 and a shut-down of the network.This is certainly not the result of the max-min optimization).Further, we reveal the connection of noise covariance constraint in one problem and transmit covariance in the other via linear subspaces and their orthogonal complements.Unlike existing work, we directly include scenarios where the noise covariance is non-invertible by using the rather general Lagrangian Multiplier Rule to formulate the optimality conditions.Computing the full subdifferential of the utility allows us to parameterize the complete solution set.The direct connection of downlink and uplink solutions via the optimality conditions renders explicit transformation rules, as discussed in [9,11], obsolete.The novel minimax duality unifies and extends several existing results, for example the least favorable noise capacity [17,18] and optimization of the transmit covariances under a per antenna power constraint [14,16].
Our work extends the traditional BC-MAC duality in two dimensions: from the BC-MAC scenario to arbitrary interference networks and from simple linear power constraints to a more general type of constraints.Many optimization problems in interference networks are proven to be NP-hard, so our duality can not help to solve those efficiently.Usually, efficient solvability is tied to the BC-MAC.By modelling this scenario as a specially structured interference network we are able to state conditions for efficient solvability by the network structure and the constraints imposed.This enables future use for other scenarios, for example relay channels where interference is removed by other means or cooperative transmission of multiple transmitters (with individual constraints), single frequency broadcast networks, or network MIMO.Concerning practical applications, there are several applications and problems that are intractable without our duality for example MIMO transmission strategies that manage and handle uncertainty by inter-cell interference.Numerically computing the worst-case noise covariances was previously not possible for more general networks.The worst-case noise approach can be used to handle the otherwise complicated coupling of interference networks, for example in cognitive radio networks [29] or device-to-device networks [30].Optimizing the BC channel for shaping constraints was not possible without the extension to the more general constraints by our duality.The shaping constraints reduce the uncertainty in interference networks.In [31] the duality is extended to multiple linear constraints and practical algorithms for numerical computation are presented in [32].Combining the worst case noise approach and the shaping constraints facilitates a very general cognitive radio concept that also holds for receivers with multiple receive antennas and enables efficient solvability of the underlying problems, see [29] for details.Further, our duality enables information theoretic proofs concerning cooperation in networks [33] and optimality of proper signaling [26,34].
The paper is organized as follows.In Section 2, we discuss our system model and introduce our idea of linear conic constraints.In Section 3, we present our main contribution: the minimax duality with linear conic constraints is stated in Theorem 1. Applications of the minimax duality are discussed in Section 4. In Section 4.1, we relate our work to existing results and show how they can be reproduced by reformulating them for our minimax duality, and in Section 4.2 we discuss novel results enabled by our minimax duality.In Section 5, we discuss conditions for existence of a solution to the minimax problem, we state and investigate the optimality conditions, and prove the minimax duality.
The following notations are used.Vectors are denoted by lower case bold and matrices by upper case bold letters.Additionally, we use upper case bold letters for tuples of matrices, such as A = (A 1 , . . . ,A K ).The operator • H stands for Hermitian transpose, tr(•) is the trace of a matrix, and |•| is the determinant of a matrix.The order relationships and are understood in the positive-semidefinite sense for matrices.For matrix tuples, A B means A k B k ∀k and A B means A k B k ∀k.We use I for the identity matrix, or a tuple of identity matrices, and 0 for the all zero matrix, or a tuple of all zero matrices.The dimensions of I and 0 are either clear form the context or explicitly mentioned.We denote sets by upper case calligraphic letters.The linear subspace of N × N Hermitian matrices is denoted as S N×N and the subspace of tuples of Hermitian matrices, where the k−th element is N k × N k , is denoted as ∏ k∈K S N k ×N k .For linear subspaces, the operator ⊕ denotes the direct sum.Given S, let T, T ⊥ such that [T T ⊥ ] unitary and full rank, T H ST 0, and T ⊥H ST ⊥ = 0, then we say that T, T ⊥ provide a full unitary basis for the fundamental subspaces of S. By this we can parameterize S as and the pseudo inverse, denoted as S + , is given by S + = T(T H ST) −1 T H .

System Model
We consider a MIMO interference network with a set of data links K, with K = |K|.The transmitter of the link k has N k antennas and the receiver has M k receive antennas.The fixed and flat-fading channel between the transmitter of link i and the receiver of link k is k , and the output symbol is x k ∈ C M k .The input and output of a link k are related by where n k ∈ C M k is additive noise that is zero mean circularly symmetric Gaussian with covariance Assuming all transmit and noise signals to be independent, the interference plus noise covariance at the receiver of link k is The dual network has the same set of links with roles of receiver and transmitter inverted and flipped channels, meaning the channel between the uplink transmitter of link i and the uplink receiver of link k is H H ik ∈ C N k ×M i .We refer to the original problem as the downlink and the dual network as the uplink.In the uplink, the zero-mean proper Gaussian input symbol of link The input and output of a link k are related by where The interference plus noise covariance at the receiver of link k is Choosing the channel matrices accordingly, this model is general enough to cover various forms of interference networks including interfering broadcast and multiple access channels as well as mixtures thereof, see [12] for details.In Section 4.1.5,we discuss in more detail how to model a broadcast channel and the corresponding multiple access channel with non-linear interference cancellation.
For the downlink, the mutual information between x k and y k , denoted as I k (x k ; y k ), can be expressed as a function of the noise covariance R k and the transmit covariances Q = (Q 1 , . . ., Q K ).For the uplink, the mutual information between ρ k and ξ k , denoted as I k (ρ k ; ξ k ), can be expressed as a function of the noise covariance Ω k and the transmit covariances Σ = (Σ 1 , . . ., Σ K ).For the considered network optimization problems the utilities are weighted sums of the mutual informations of the links: where w 1 , . . ., w K are non-negative weights, which can be used to prioritize links or to explore boundary points of the achievable rate region.We assume that interference is treated as additional noise, which allows us to express the utility by the interference plus noise covariances S = (S 1 , . . ., S K ) and Ω = (Ω 1 , . . ., Ω K ) defined by Equations ( 4) and ( 6): where in case the mutual information is finite The conditions for finite mutual information and a derivation of Equations ( 11) and ( 12) can be found in Appendix A.

Linear Conic Constraints
The transmit and noise covariances are constrained by linear conic constraints: where B = (B 1 , . . ., B K ) and C = (C 1 , . . ., C K ) are fixed, and the degrees of freedom available for optimization of Z = (Z 1 , . . ., Z K ), which are linear subspaces of tuples of appropriately sized Hermitian matrices, in particular Z ⊆ The prototype for the linear conic constraints Equations ( 13)-( 16) is The choices for X ∈ X that allow for positive semidefinite W are given by A + X 0. If A and X are matrices (instead of tuples of matrices), this is a linear matrix inequality (LMI), the intersection of a affine subspace with the cone of positive semidefinite matrices.The constant nullspace of a LMI is the set of vectors λ for which λ H (A + X)λ = 0 ∀X ∈ X where A + X 0, see [35] for details.In this work, we additionally regard tuples of matrices, where the positive semidefinite constraint has to hold for every element of the tuple, while the subspace is defined for the tuple.Hence, we define a set that is similar to the constant null-space, but is defined in the matrix tuple space instead of the vector tuple space: Additionally, we define a set that contains all the directions where all elements of the tuple are positive semidefinite: Lemma 1.Let A = {λA : λ ∈ R} and X ⊥ the orthogonal complement of A ⊕ X with respect to the appropriately sized Hermitian matrices, then P (X ⊥ ) ⊆ N (A, X ).
Proof.See Appendix B.
Note that in general N (A, X ) ⊆ P (X ⊥ ) (Take the following example:

Relationship to Linear Constraints
There exist several network dualities, where the transmit covariances are constrained by one or multiple linear constraints [13][14][15][16].So how do the linear conic constraints relate to the linear constraints?As known from semidefinite programming, a LMI can always be expressed in primal form with a finite set of linear constraints and one positive-semidefinite constraint.In principle, this can be done for Equation (17), but this does not result in linear constraints on the covariance.The following Lemma states a condition under which Equation ( 17) can be replaced by multiple linear constraints on W, which then can be handled by the existing dualities [13][14][15][16].
Lemma 2. Let A = {λA : λ ∈ R} and X ⊥ be two subspaces such that A ⊕ X ⊥ is the orthogonal complement of X .If the set E = E : E 0, E ∈ A ⊕ X ⊥ is polyhedral, then the linear conic constraint W A + X, X ∈ X , can be formulated by a finite number of linear constraints on W, i.e., where E 1 , . . ., E E are the extreme directions of E .
Proof.See Appendix C.
For the inverse direction: a single linear constraint can always be replaced by a linear conic constraint, see for example Section 2.1.2.So multiple linear constraints can be transformed to multiple conic constraints, a case which is not regarded in this work but suggested as an extension a future work in Section 6.For special cases, such as in Section 2.1.2,multiple linear constraints can be represented by a single conic constraint.Linear conic constraints allow to model a variety of constraints on the covariances such as sum power constraints, per-antenna power constraints, or shaping constraints.The constraints can be joint constraints on all links, groups of links, or individual constraints per link.In the following, we present some examples how several relevant constraints can be modeled by linear conic constraint.

Examples
Network Sum-Power Constraint Consider a constraint on the downlink transmit covariances that constrains the sum-power output of the network by By Lemma 2, we identify the linear conic version of the constraint as Per Link Sum-Power Constraint If the power per link is constrained individually, i.e., then by Lemma 2 we identify the linear conic version of the constraint as A shaping constraint, that is Q C, is already given in the form of a linear conic constraint where, Z = {0} and Z ⊥ = Z ⊥ : ∑ k∈K tr(C k Z k ) = 0 .A shaping constraint cannot be formulated by a finite number of linear constraints, as the set E is the cone of positive semidefinite matrices, or the tuple version thereof, which is not polyhedral and has infinitely many extreme directions.

Minimax Duality with Linear Conic Constraints
Theorem 1.Given is a MIMO interference network (downlink) with data links K and the dual network (uplink) with the same set of data links but roles of receiver and transmitter inverted and flipped channels.Consider minimax problems with a weighted-sum of the links' mutual information as utility and linear conic constraints on the transmit and noise covariance matrices: The subspaces that define the constraint sets are B = {λB : λ ∈ R}, Y, Y ⊥ and C = {λC : λ ∈ R}, Z, Z ⊥ , where ∑ k∈K tr(B k B k ) = ∑ k∈K tr(C k C k ).The subspace triples B, Y, Y ⊥ and C, Z, Z ⊥ , respectively, are mutually orthogonal and their direct sum is the space of all K-tuples both problems have a solution and it holds C D = C U .
Furthermore, there exists a solution of the downlink problem that is connected to a solution for the uplink problem by inverting the roles of the optimization variables and Lagrangian multipliers, that is where γ = γ = γ (We introduce additional optimization variables Š and Ψ, which are defined by Equations ( 4) and (6).The connection of Lagrangian multipliers to the constraints can be found in Table 1).

Subsitutions and constraints on dual variables
Remark 1.The Theorem holds for arbitrary channel matrix sizes and there are no assumptions on the rank of the channel matrices.Whether the minimax problems have a solution does not solely depend on the channel matrices, instead we need to jointly consider the constraints and channel matrices.In general, this can not be done by analyzing individual links as the tuple subspaces can couple all links of the network.The derivation of the joint conditions on channels and constraints for existence of a solution (C1)-(C4) can be found in Section 5.1.
Remark 2. The mutual information of a link is independent of the noise covariances of the other links and the utility is non-increasing in the noise covariance, thus we can always find a solution where the noise covariance constraint holds with equality.
Remark 3. If the feasible set for the downlink covariances is given by this is mathematically equivalent to This formulation was used in work based on earlier versions of the duality, see for example [36].
The Theorem requires , which is not always the case for the problems considered in the following.By scaling of the channel matrices and optimization variables we can artificially enforce the condition for the downlink.By reverting this scaling of the channel in the uplink we obtain an asymmetric version of the minimax duality, which is formally stated by the following lemma: Proof.See Appendix D.

Applications
We directly proceed with applications of the minimax duality and present the rather technical proof in Section 5.

Original Minimax Duality
As our result is an extension and generalization of the result in [10], we are able to reestablish the original minimax duality as a special case.Specifically, we reproduce the proof of the Sato bound to be tight for the sum-rate in the broadcast with non-linear interference presubtraction.The Sato upper bound on the sum-capacity of the multi-user downlink is established by assuming full cooperation of the receivers [37], which makes the scenario equivalent to the optimization of a point-to-point link, where the minimization is with respect to the joint noise covariance, where the user noise covariances are fixed blocks on the diagonal and the off-diagonal blocks can be freely chosen.
The set of users is U , with U = |U |, where M u is the number of receive antennas of user u.The transmitter has N transmit antennas and M = ∑ u∈U M u the number of total receive antennas.The channel of user u is H u ∈ C N×M u and the composite channel of the point-to-point channel where all receivers cooperate is H = [H T 1 , . . ., H T U ] T ∈ C N×M .The receive symbol covariance in the downlink, and therefore the transmit symbol covariance in the uplink, is block partitioned such that block i, j is the covariance of the symbols received by user i and j and the k-th block on the diagonal is the marginal covariance of user k.We assume the downlink noise to be the identity matrix scaled by σ 2 for every user.The appropriate model for subspaces B, Y, Y ⊥ , which are subspaces of S M×M , is B = σ 2 I. Y ⊥ is the subspace of Hermitian matrices that have all zero matrices as blocks on the diagonal and allow for an arbitrary choice of the other blocks, which implies Y is the set of all blockdiagonal matrices with trace equal to zero.Let the structure of * and * ⊥ be as follows * = According to Section 2.1.2,the linear conic version of the sum-power constraint on the downlink transmit covariances is where C, Z, Z ⊥ are subspaces of S N×N .The downlink problem is min With B 0 and C 0 conditions (C1)-(C4) hold true, and using the asymmetric minimax duality by Lemma 3 the uplink problem is min With Z ⊥ = {0}, Ω = σ 2 I is a solution for the uplink noise, see Remark 2. For the constraint on the uplink transmit covariance, we observe that B and all elements of Y are blockdiagonal.Thus, Σ will be blockdiagonal, and the users do not cooperate in the uplink.Furthermore, Σ P M I + * , tr( * ) = 0 implies a sum-power constraint of P of the uplink transmit covariances.Let Σ 1 , . . ., Σ U be the blocks on the blockdiagonal Σ, then the uplink problem is max We can see that the value of the uplink problem is equal to the sum-capacity of a multiple access channel with a sum-power constraint.It is well known that for the same sum-power constraint the same sum-rate can be achieved in the broadcast channel [4,8,9], which proves the Sato bound to be tight for the sum-rate.

Structure of the Worst Case Noise Covariance
In [9] it is shown that Equation ( 80) is a solution to the worst case downlink noise covariance problem Equation (70) if R is non-singular.Further, it is conjectured that it is also a solution for the singular case, but a proof is missing.By Lemma 4 we restate this result and provide an alternative proof that also holds for the singular case.The uplink problem Equation (74) can be reformulated as (For simplicity, but without loss of generality, we set Let A, λ, F, and M be Lagrangian multipliers for the constraints D = I + H H ΣH, tr(Σ) ≤ P, Σ is blockdiagonal, and Σ 0.
Lemma 4. Given a solution D , Σ to the uplink problem with Lagrangian multipliers A , λ , the remaining Lagrangian multipliers can be selected as and a solution to the worst case downlink noise covariance problem Equation ( 70) is given by . . .
Proof.See Appendix E.

Worst Case Noise Capacity
The capacity of a point-to-point link with channel H ∈ C M×N under a worst case noise assumption is given by max In [17], it is shown that this worst case noise capacity is equivalent to the capacity without channel knowledge and white noise.
While in [17] this is proven by matrix majorization theory, it can alternatively be reproduced by the minimax duality.Computation of Equation ( 81) means to solve a convex-concave game with individual convex constraint sets, for which max and min can be exchanged and we can instead use min The sum-power constraints are modelled according to Section 2.1.2: and With B 0 and C 0 conditions (C1)-(C4) hold true and using the asymmetric minimax duality by Lemma 3 the uplink problem is min Here we regard the special case, where the noise covariances are fixed and appear as a generalized sum-power constraint in the dual network.Let and where we assume R, Ω, and the channels such that the maxima exist.This scenario is for example considered in [12], where by using an SINR duality it is proven that S D (R, Ω) = S U (Ω, R) and the polite waterfilling result is established.In the following, we show how the network maximization problems under generalized sum-power constraints, Equations ( 88) and (89), can be formulated in our minimax framework.It can be verified that the conditions for existence of the maxima of Equations ( 88) and (89) imply conditions (C1)-(C4).For the downlink, the absence of a minimization over the noise covariance can be modelled, by selecting which means that R is a solution for the downlink noise covariances, see Remark 2. The conic version of the generalized sum-power constraint is introduced in Section 2.1.2: Using the asymmetric mini-max duality by Lemma 3, the uplink problem is min b , and we obtain min which is the minimax version of Equation (89).

Duality of Broadcast and Multiple Access Channel
As in Section 4.1.1,the set of users is U , with U = |U |, and the channel of user u with M u receive antennas is H u ∈ C N×M u , where N is the number of antennas at the broadcast transmitter.Broadcast and multiple access channels are modelled by considering one link per user and first setting interference between a user u and user v is removed by non-linear interference cancellation, we set H vu = 0 instead.This leads to the well known connection: given some ordering of the users, removing interference in the downlink such that a user does not interfere with a user of higher order matches the uplink model where interference is successively canceled in the inverse order.Thus, our minimax duality provides a minimax BC-MAC duality for any type of constraints that can be modeled as linear conic constraints.It holds for linear precoding as well as non-linear interference cancellation in an arbitrary order.
A particularly interesting case is where the decoding order of the uplink is matched to the weights of the users.If the decoding order is equal to the ascending order of the weights and additionally the noise covariance is the same for every user in the uplink, then the inner maximization of the uplink problem can be reformulated as a convex optimization problem.This renders the uplink problem a convex-concave game, for which efficient algorithms to find a solution are available.The following lemma describes the structure of the linear conic constraints and the subspaces that imply an equal uplink noise covariance for all users.
Lemma 5. Let the subspaces C = {λC : λ ∈ R}, Z , Z ⊥ such that they are mutually orthogonal and their direct sum is S N×N .If the constraint on the downlink transmit covariances is a constraint that solely acts on the sum of the transmit covariances, i.e., then the constraint on the uplink noise covariances is which allows for a solution where all noise covariances are equal.
Proof.See Appendix F.
Lemma 6.Consider a broadcast problem.If the encoding order is equal to the descending order of the user weights, the constraint on the downlink transmit covariances solely acts on the sum of the transmit covariances, and conditions (C1)-(C4) hold true, then every point that fulfills the optimality conditions is a solution.
Proof.The uplink problem can be reformulated as convex-concave game, where every point that fulfills the optimality conditions is a solution.By Lemma 11 every point that fulfills the downlink optimality condition also fulfills the uplink optimality conditions and therefore is a solution.
Thus, for these scenarios we have the freedom to either solve for the uplink or downlink optimality conditions, whatever is more convenient.
Lemma 7. Consider a broadcast problem.If the encoding order is equal to the descending order of the user weights, the constraint on the downlink transmit covariances solely acts on the sum of the transmit covariances, and conditions (C1)-(C4) hold true, then min Proof.By Lemma 6 every point that fulfills the optimality conditions of Equation ( 96) is a solution.
The optimality conditions are the same for Equations ( 96) and (97) and therefore both problems have an equal optimal value.

Interference Robust Multi-User MIMO
Our multi-user minimax duality enables new results concerning robustness to interference in MIMO networks, where uncertainty in the spatial signature of interfering signals is a major source of performance degradation.In the companion work [36], two possible techniques to provide robustness for interfering broadcast channels are discussed.Both decouple the optimization of the network into individual problems per basestation, one by considering the interference of the other cells by a worst-case approximation and the other method enforces fixed sum-transmit covariances at each transmitter, which removes the uncertainty in the interference.
For the worst-case approximation, the minimization of the noise plus other-cell interference covariance in the downlink is constrained by a noise power constraint for every user individually, which translates to scaled identity matrices as transmit covariances in the uplink, see Section 2.1.2.The sum-power constraint on the downlink transmit covariances leads to fixed uplink noise covariances, see Section 2.1.2.Thus, the uplink problem is a maximization of the scaling coefficients of the uplink transmit covariances under a constraint on the sum of the coefficients.For details see Appendix G.This result provides a generalization of the worst-case noise capacity from point-to-point channels [17] or sum-rate in the broadcast channel [18] to the complete capacity region of the MIMO broadcast channel.
The second approach constrains the sum of the downlink transmit covariances by a shaping constraint, which can be fulfilled with equality for some solution (If the shaping constraint is fulfilled with equality depends on the number of receive antennas and the rank of the channels.Equality can be artificially enforced by adding a virtual user whose interference to the other users is canceled by non-linear interference pre-subtraction.Whether the gain by increased robustness outweighs the pain by additional interference to the other cells depends on the scenario).Assuming the channels to be static (for some time period) the constant transmit covariances lead to a constant inter-cell interference covariance at the users, which removes the uncertainty.The fixed noise covariances in the downlink translate to a sum power constraint on the uplink transmit covariances.The shaping constraint on the sum of the transmit covariances leads to equal uplink noise covariances for all users in the uplink, where the minimization is under a noise power constraint, see Section 4.1.5.
Both approaches can be modelled by using our minimax duality, see [36] for details.As for both approaches the constraints on the downlink transmit covariance are constraints that act solely on the sum of the transmit covariance, i. e. a sum-power constraint and a sum shaping constraint, the uplink problem has a convex-concave game reformulation and can be solved efficiently for non-linear interference (pre-)subtraction.

Information Theoretic Proofs Cooperation in Wireless Networks
The connection of uplink and downlink via orthogonal subspaces allows to model cooperation in wireless networks, as for example the cooperation of the receivers to compute the Sato bound.Reconsider the result of Section 4.1.1:By letting the receivers cooperate, the correlations among the noise symbols of different users are included into the optimization and can be freely chosen by allowing all degrees of freedom on the off-diagonal blocks of the joint noise covariance, which induces a linear subspace.As a result, the joint uplink covariances are in the orthogonal subspace, which results in a block-diagonal matrix and thus no cooperation of the transmitters.Without this cooperation, the uplink is equivalent to a multiple access channel and by the BC-MAC duality translates to a broadcast channel without cooperation.Thus, whenever the additional degrees of freedom introduced by cooperation can be modeled as a linear subspace, we can use the minimax duality to transfer the problem into the uplink, which then might reveal whether cooperation is beneficial.An example can be found in [33], where carrier-cooperation is modelled in our minimax duality.

Optimality of Proper Signaling
Results from information theory show that improper signals are beneficial for some communication scenarios.Recent results use our minimax duality to proof the optimality of proper signaling for the MIMO broadcast channel under a shaping constraint [26] and for the MIMO relay channel with partial decode-and-forward [34].A key ingredient for the proof is the observation that in a composite real representation a covariance matrix can be partitioned in a power shaping component and an impropriety component, such that the components are elements of linear subspaces that are orthogonal complements.Using such a formulation in our minimax duality, the problem can be transfered to an uplink problem, where the worst case noise is proper.For the considered scenarios, it can be shown that there exist solutions for the uplink with proper transmit symbols.The translation back into a downlink solution preserves this property.

Conditions for Existence of a Solution
To derive conditions (C1)-(C4), we use the generalization of the constant nullspace Equation (18), and the positive semidefinite directions of a subspace Equation (19).For the downlink, the following conditions ensure that those directions where noise or transmit covariance can become arbitrarily large have no influence on the utility The constraints on the transmit covariance can be used to prohibit certain spatial directions of the transmit signal, resulting in a non-trivial constant nullspace N (C, Z ) = {0}.By a projection of the channel matrix we can artificially enforce without changing the solutions.By imposing this condition we are able to formulate the conditions for the inner optimization to have a finite value as a condition on the channels and independent of the constraints on the transmit covariance: The inequality of the transmit covariance constraint allows us to remove any interference to k by setting all other transmit covariances to zero and we have S k = R k .As λ H k R k λ k = 0 for all feasible R k we can use λ H k as a receive filter to obtain a noise free communication channel, and the inner optimization does not have a finite value.For the uplink, the equivalent conditions are Combining the conditions for downlink Equations ( 98)-(101) with the conditions for the uplink Equations ( 102

Properties of the Solutions -Optimality Conditions
Before we present the proof of the Theorem 1 in Section 5.4, we investigate some properties of the solutions and necessary optimality conditions of the minimax problems.A good candidate for optimality conditions are the KKT conditions, but as the utility fails to be differentiable everywhere we use the more general Lagrange Multiplier Rule, see for example [38,Th. 6.1.1].The conditions are necessary, but not sufficient, for optimality.
By Remark 2, there is always a solution for the noise covariances where the linear conic constraint holds with equality.This allows us to actively enforce equality, which may reduce the set of solutions but does not affect the optimal value.For the proof, we will introduce N 0 and L 0 as slack variables for the constraints Additionally, we will use scaled versions of the optimization problems, and we explicitly include the interference plus noise covariances into the optimization: (a) Given α > 0 and a point which fulfills the optimality conditions for CD (α), a point with equal utility, which fulfills the optimality conditions for α = 1, can be found by scaling the optimization variables by 1 α and the Lagrangian multipliers by α.(b) Given β > 0 and a point which fulfills the optimality conditions for CU (β), a point with equal utility, which fulfills the optimality conditions for β = 1, can be found by scaling the optimization variables by 1 β and the Lagrangian multipliers by β.Proof.We introduce Lagrangian multipliers as shown in Table 1.The Lagrangian multiplier for a subspace constraint is element of the orthogonal complement of the subspace.Therefore, the Lagrangian multiplier for Z ∈ Z is element of C ⊕ Z ⊥ , which we parameterize by νC + Z ⊥ , Z ⊥ ∈ Z ⊥ in order to explicitly highlight the component in the direction of C. The same explanation holds for the Lagrangian multiplier µB + Y, Y ∈ Z ⊥ for the constraint Y ∈ Y ⊥ .The Lagrangian function for CD (α) can be written as where the signs are selected such that Ω, K, L are positive semi-definite.As and by introducing the auxiliary variable Ψ, where the Lagrangian function can be written as The optimality conditions for CD (α) are shown in Table 1.Equations ( 27)-( 33) are the constraints on the optimization variables, Equations ( 34) and ( 35) are the properties of the Lagrangian multipliers due to the chosen parameterization, Equation ( 36) is the substitution introduced by Equation (110), Equations ( 37)-(39) are the complimentary slackness conditions for the inequality constraints, and Equations ( 40)-( 44) are the stationarity conditions.The Lagrangian function is differentiable with respect to Z, Y ⊥ , R, Q, which in this order gives us Equations ( 40)-( 43).The utility is not differentiable with respect to S at a point where S is not invertible and we have to compute and parameterize the complete subdifferential to obtain Equation (44).This can be done by using [38, Th. 2.5.1],see Appendix H for details and the definition of the set E ∆ k .As a remark, be a solution of the scaled downlink, and substitute (R, Y ⊥ , Q, Z, N, S) by α( Ř, Y⊥ , Q, Ž, Ň, Š) and (Σ, Ω, ν, Z ⊥ , K, X, µ, Y, L, Ψ) by 1 α ( Σ, Ω, ν, Ž⊥ , Ǩ, X, μ, Y, Ľ, Ψ).Thus, the scaling factor α cancels out everywhere and provides a point that fulfills the optimality conditions of the unscaled problem, where α = 1.
The utility Equation ( 11) is not changed by an equal scaling of interference-plus-noise covariance and transmit covariance.This proves (a).The conversion between scaled and unscaled problem is For the uplink, we use the substitution and the Lagrangian function can be written as (116) The explanation of the optimality conditions of the uplink, the definition of Q ∆ k , and the proof of (b) follows by symmetry.The conversion between scaled and unscaled problem is The characterization of the solutions to optimization problems for MIMO interference networks by polite waterfilling is introduced in [12].The next lemma states the polite waterfilling result for the special case of an isolated point-to-point link.Although a proof can be found in the original work [12], we decided to include an alternative proof that especially highlights scenarios with non-invertible noise covariances and the conditions for which these have a solution.Further, we present the proof in a way that is directly connected to our problem, which allows us to introduce an additional result as a corollary to the proof.Lemma 9. Consider a MIMO link with channel matrix H and non-zero noise covariance S and a link with flipped channel H H and non-zero noise covariance Ψ.The matrices T, T ⊥ and Φ, Φ ⊥ provide a full unitary basis for the fundamental subspaces of S and Ψ respectively.
If HΦ ⊥ = 0 and T ⊥H H = 0, then the mutual information of both links is finite, the problems sup and sup Σ 0 have a solution, and the following equalities hold for any pair of solutions: where the definition of E ∆ and Q ∆ is in Lemma 12, presented in Appendix H.We say that Q, Σ, S, Ψ are connected by polite waterfilling if they fulfill the equalities of the Lemma.
Proof.The condition for the downlink mutual information to be finite is T ⊥H H = 0, see Lemma 12 in Appendix A. If HΦ ⊥ = 0, there exists a q with Hq = 0 and tr(Φqq H ) = 0 and for Q = αqq H the utility becomes arbitrarily large for increasing α.So, if HΦ ⊥ = 0, then Equation (118) does not have a solution.Conversely, HΦ ⊥ = 0 implies tr(ΨQ) > 0 whenever HQ = 0, and as the logarithm grows slower than any linear function, the supremum is finite.By symmetry, the condition for a finite uplink mutual information is HΦ ⊥ = 0 and the condition for Equation (119) to have a solution is T ⊥H H = 0.
Assume the conditions of the lemma hold true and consider the problem max which has the same solutions as Equation (118).
As the utility fails to be differentiable everywhere, the popular KKT conditions cannot be applied, and we use the more general Lagrange Multiplier Rule, see for example [38,Th. 6.1.1].Let Σ and K be the Lagrangian multipliers for S = S and Q 0, the optimality conditions are where E ∆ is given by Lemma 13 in Appendix H. Furthermore, consider the following problem max which has the same solutions as Equation ( 119).Let Q and M be the Lagrangian multipliers for Ψ = Ψ and Σ 0. The optimality conditions are where Q ∆ is defined analogously to E ∆ given by Lemma 13 in Appendix H.By standard calculus, it can be shown that every solution to Equations ( 121)-( 123) is a solution to Equations ( 125)-( 127) and vice versa, and that these solutions fulfil the equalities of the Lemma.See Appendix I for details.
Corollary 1.For both CD (α) and CU (β), if a point fulfills the optimality conditions, then for every link k ∈ K, Q k , Σ k , S k , Ψ k are connected by polite waterfilling.
Proof.Consider the downlink and notice that Equations ( 121)-( 123) are fulfilled by Equations ( 30), ( 34), ( 38), (43), and (44), meaning that Q k , Σ k , S k , Ψ k are connected by polite waterfilling if the conditions for the Lemma, these are H kk Φ ⊥ k = 0 and T ⊥ k H kk = 0, hold.Consider the downlink.By conditions (C1)-(C4) we know that unless T ⊥ k H kk = 0 the mutual information is infinite, and this point does not fulfill the optimality conditions.By multiplying Equation ( 43) with Φ ⊥H k from the left and Φ ⊥ k from the right we obtain As both summands are positive-semidefinite matrices, they must both be equal to 0, and with (a) for every point that fulfills the downlink optimality conditions, we have (b) for every point that fulfills the uplink optimality conditions, we have Proof.The mutual orthogonality of the linear subspace triples B, Y, Y ⊥ and C, Z, Z ⊥ , respectively, implies and respectively.Consider the downlink.By combining Equations ( 37) and (40), we have Multiplying Equation (31) with B from the right, applying the trace operator on both sides, and summing over all links, we obtain Further, combining Equations ( 41) and ( 42) we have Σ = µB + Y − L and multiplying with R from the left, applying the trace operator operator on both sides, and summing over all links gives us where we used tr(R k L k ) = 0 from Equation (39).By combining Equations ( 140) and ( 138) it holds: Multiplying Equation ( 27) by Σ k from the right and Equation (43) by Q k from the right, applying the trace operator on both sides, and summing over all links gives us With the trace property Equation (109) and the equivalence of the penalty terms from the polite waterfilling property Lemma 9 Equation ( 9), we obtain Combining this with Equations ( 136) and (141), we have The proof for the uplink follows by symmetry.
To prove (a) for the downlink, we show that all conditions in Equations ( 27)-(44) that are not explicitly stated in the shared conditions hold for any point that fulfills the shared conditions.For the downlink this is condition Equation (37), which holds by combining Equations ( 148) and (155), and conditions Equations ( 41) and (42), which are equivalent to Equation (149) by eliminating the superfluous variable X.The proof for the uplink follows by symmetry.
To prove (b), we show that all shared conditions that are not explicitly stated in Equations ( 27)-(44) hold for any point that fulfills Equations ( 27)-(44).Conditions Equations ( 148) and (155) hold by Equation (37) and N = αC + Z − Q as N is the slack variable for Equation (148).N 0 in Equation ( 160) is by definition of N. The conditions Equations ( 154), (156), and (158), hold true by the polite waterfilling connection due to Corollary 1.The proof for (c) follows from the proof for (b) by symmetry.

Proof of the Network Duality for Fixed Noise and (Generalized) Sum-Power Constraint
Before we prove C D = C U for the general minimax problems, we discuss the special case where the noise covariances are fixed and appear as a generalized sum-power constraint in the dual network.This is the scenario from [12] introduced in Section 4.1.4,where the functions S D (R, Ω) and S U (Ω, R) are defined by Equations ( 88) and (89) respectively.As we have used the polite waterfilling result from [12] to prove Lemma 11, it is not surprising that we can in turn use Lemma 11 to prove S D (R, Ω) = S U (Ω, R).To do so, we have to reformulate S D (R, Ω) and S U (Ω, R) in the minimax framework, see Section 4.1.4for details.By Lemma 11 combined with Corollary 1, every solution to Equation (88) provides a point with equal utility that fulfills the optimality conditions of Equation ( 89) and vice versa.Assume there is a solution to Equation (88) and the point is not a solution to Equation (89), then there exists a point with higher utility in Equation (89).As this point needs to fulfill the optimality conditions, there must be a point with equal utility in Equation ( 88), this contradicts with the original point being a solution, and therefore S D (R, Ω) = S U (Ω, R).

Proof of the Minimax Duality
Unfortunately, the argumentation of the previous section cannot be extended to minimax problems, which might have multiple points fulfilling the optimality conditions with different utilities.In addition to the solutions, there might exist points which fulfill the optimality conditions with higher or lower utility than the optimal value.To prove C D = C U for general minimax problems, we first show that both problems share an upper bound, and second, we show that this upper bound is tight.Consider a reformulation of the downlink problem as where We upper bound the inner, potentially non-convex, maximization from above with a Lagrangian dual problem: where we assumed R such that the maximum of Equation ( 164) exists.The infimum does not change if we remove those Ω where the inner problem does not have a solution.As Z is only constrained by Z ∈ Z, the inner problem of Equation (165) does not have a solution unless Ω is in the orthogonal complement of Z, which we can parameterize by Thus, we can formulate the upper bound as Furthermore, by Corollary 1, we know there exists a solution to C D where optimization variables and Lagrangian multipliers are connected by polite waterfilling.Using such a solution for Ω to evaluate the inner problem of Equation (166), Ω and ∑ k∈K tr(Ω k C k ) are constants for the inner problem.As we assumed that R is such that the mutual information of all links is finite for finite transmit symbols, the inner problem has a solution.This implies that the infimum and supremum of Equation (166) are attained.
For every minimizing dual variable, the following conditions can be obtained from the complementary slackness conditions: The upper bound can be reformulated as The value of the inner problem is the same if Ω is scaled (leading to an inverse scaling of the optimization variables).This allows us to fix the scaling by picking a P with and scale Ω such that Combining Equations ( 170), (171), and Ω = νC + Z ⊥ , Z ⊥ ∈ Z ⊥ , we obtain ν = 1, and the upper bound is where S D (R, Ω) is defined by Equation (88).Thus, we can formulate an upper bound on C D by Now consider the uplink problem.By using R = τB + Y ⊥ , Y ⊥ ∈ Y ⊥ as Lagrangian multiplier to relax the constraint on the uplink transmit covariances and selecting we can formulate an upper bound for the uplink as where S U (Ω, R) is defined by Equation (89).We have P = ∑ k∈K tr(B k B k ) = ∑ k∈K tr(C k C k ) and as S D (R, Ω) = S U (Ω, R), see Section 5.3, the bounds Equations ( 175) and (177) have the same value, and the problems C D and C U share an upper bound.
We can prove C D = C U by showing that the upper bound is tight.The bound by the Lagrangian dual problem on the inner problem of the downlink can be reformulated as an uplink minimax problem: where we used S D (R, Ω) = S U (Ω, R) and replaced the generalized sum-power constraint ∑ k∈K tr(R k Σ k ) by a conic constraint with and which implies Ȳ ⊥ = {0}, see Section 2.1.2for an explanation.Equivalence of Equations ( 182) and ( 183) is given by Lemma 8.By Lemma 11, every solution of Equation (183) fulfills the conditions Equations ( 45)-( 62) and provides Lagrangian multipliers S, R, Q, Z, N, τ with and as Ȳ ⊥ = {0}, we have Lemma 10 holds true even if ∑ k∈K tr( Bk Bk ) = ∑ k∈K tr(C k C k ), and by Equation (131), we have where we used ∑ k∈K tr( Bk Bk ) = ∑ k∈K tr(R k R k ) , which can be derived from Equation (184).Combined with Equation (189), we obtain By Lemma 8(b), τ scales inversely with β without affecting the utility, so we are free to pick β such that τ = 1.Given such a solution to Equation (183), the Lagrangian multipliers S, Q, Z fulfill Equations ( 187) and (188).By using τ = 1 and R = R, Equations ( 187) and ( 188) can be written as Directly including the explicit parameterization of the interference plus noise covariance in Equation (178), we have and we can see that Q, Z are a feasible solution to Equation (178) and have the same utility by the polite waterfilling connection, Lemma 9(e).Thus, Equation (165) holds with equality and the upper bound Equation ( 175) is tight for the downlink.Tightness of the upper bound for the uplink follows by symmetry and we have proven By Lemma 10, we have σ = τ, and by introducing γ = σ = τ, a solution to the unscaled uplink problem can be stated as For any β and the conversion rule Equation (117), introduced with Lemma 8, a solution to C U (β) is given by Inverting the roles of Lagrangian multipliers and optimization variables we obtain a solution to C D (α) for some α as 1 By the conversion rules Equation (114) a solution to the unscaled downlink problem is given by 1 Introducing γ = ν = μ and comparing the solution obtained from the uplink problem to the prototype of the downlink solution we identify γ αβ = 1 and αβ = γ.Introducing γ = γ = γ = αβ, we can see that uplink and downlink solution are connected by inverting the roles optimization variables and Lagrangian multipliers and a scaling by γ, respectively 1  γ , which proves the last part of the Theorem.

Zero Duality Gap
The upper bound Equation (165) by a Lagrangian dual problem was shown to be tight.Therefore, maximization problems in interference networks with linear conic constraints have a zero-duality gap for this special choice of the dual function.The zero duality gap result does not hold in general.For example it does not hold if the dual function is selected as optimization of the Lagrangian function given by Equation (108).Although we have L D = C D for every solution, the duality gap does not disappear as sup Here, the linear penalty term is not powerful enough to prevent the exponential growth of the utility for decreasing S k .
A Zero-Duality gap can be observed for the optimization of linear precoders for power minimization under SINR constraints [14,22], which allows to transfer the apparently non-convex problem into a convex problem that can be solved efficiently.For our scenario, the dual problem is always convex in the dual variables, but evaluating the dual function S D (R, Ω) still requires to solve a non-convex problem Equation (88).So, the zero duality gap is a property worth mentioning, but it is completely useless for the design of efficient algorithms.

Uplink-Downlink Transformation Rules
Several network dualities include some transformation rule for the solution of one network to the dual network.In our approach, the complete characterization of the uplink-downlink duality by a shared system of optimality condition reveals such a transformation as a connection between optimization variables and Lagrangian multipliers.For example, the transformation of the transmit covariances from one problem to the other is given by Equations ( 44) and (62).If the noise covariance of a user k has full rank, the only valid choice for Q ∆ k , respectively Σ ∆ k , is the zero matrix and the transformations are identical to those in [12].Otherwise, Q ∆ k and Σ ∆ k , describe the additional degrees of freedom: this is where the conic constraint is not binding but the choice of has no influence on the utility.To describe the full dependencies, we start by the slack variables L, N being the Lagrangian multipliers for the positive semi-definiteness constraint of the noise covariances.So L and N indicate if and how the interference plus noise can be rank deficient, which sets the degrees of freedom for Q ∆ k and Σ ∆ and therefore the degrees of freedom in the linear conic constraint on Q and Σ, implying the set of possible slack variables.

Possible Extensions
Another direction for future work is to investigate if other types of constraints can be included in the duality.This is straight forward for the noise covariance.Let R be an arbitrary constraint set for the noise covariance R. We restate the downlink problem as where B = R and Y ⊥ = {0}.Now, we can apply the minimax duality to the inner problem and obtain where the formulation by the network sum-power constraint is explained in Section 2.1.2.Concerning the generalization of constraints on the transmit covariances, we suggest to first extend the duality to multiple conic constraints for each link.Furthermore, an especially interesting direction is to include more general (convex) constraints on the transmit covariance into our duality.In [16] convex constraints are handled by replacing them with a single linear constraint, where the parameter needs to be found algorithmically.If the multiple linear constraints can be combined into a single linear conic constraint this is inherently done by our model.The general case is an open issue and suggested as future work.

Conclusions and Future Work
We presented a minimax duality for MIMO interference networks, where noise and transmit covariances are optimized subject to linear conic constraints.We illustrated how they are general enough to not only model typically used constraints such as the network sum-power constraint, the per link sum-power constraint, and shaping constraints, but also constraints on cooperation within the network or the propriety of signals.The interconnection of the downlink and uplink problems is by the flipped channel matrices, the common constraint matrices, and orthogonal subspaces.We showed that every solution has a polite water-filling structure and the downlink and uplink problem share a system of optimality conditions, where the solutions are connected by inverting the roles of the optimization variables and Lagrangian multipliers.We proof our minimax duality by using an upper bound from Lagrangian duality, which can be shown to be tight, thus revealing a zero-duality gap of maximization problems in MIMO interference networks under linear conic constraints.
Especially interesting is the BC-MAC duality, which can also be modeled in our framework.We were able to extend the existing BC-MAC dualities in two directions.First, we allow for more general constraints (for example shaping constraints) on the downlink transmit covariance and investigate the conditions under which the uplink problem has a convex-concave game structure.Second, we extended the worst case noise capacity from the sum-rate to the complete capacity region of the MIMO broadcast with non-linear interference pre-subtraction.New applications that are enabled by our duality are discussed in Section 4.2.These are the design of interference robust multi-user MIMO transmission strategies for interfering broadcast channels and information theoretic proofs concerning cooperation in networks and optimality of proper signals.
Concerning the generalization of constraints on the transmit covariances, we suggest to first extend the duality to multiple conic constraints for each link.Furthermore, an especially interesting direction is to include more general (convex) constraints on the transmit covariance into our duality.In [16], convex constraints are handled by replacing them with a single linear constraint, where the parameter needs to be found algorithmically.Furthermore, we believe that our result can serve as the theoretical basis for further research in the fields of robust transmission strategies, cognitive radio networks, and secrecy capacity, where conic constraints and minimax problems appear naturally in the proofs and numerical computations.
we obtain the following equivalences: Let the functions W(R, Q; s) and W(Ω, Σ; s) follow the definition of W(R, Q) and W(Ω, Σ) respectively, these are Equations ( 9) and ( 10), but all channels are scaled by s.
For the uplink, we have inf as otherwise there would be no M such that M 0. Comparing Equation (E9) to definition of M implies M 0, this is Equation (E5).From Equations (E3) and (E4) follows tr(F Σ ) = 0 and from Equation (E2) we obtain λ tr(Σ ) + tr(F Σ ) = tr(H A H H Σ ) + tr(M Σ ) (E10) where we used Equations (E6) and (E7).Finally, we combine Equations ( 78) and (E6).As the offdiagonal blocks do not contribute to the trace we have where Z ⊥ is a subspace of S N×N that is orthogonal to C = {λC : λ ∈ R}.Then the uplink noise constraint is there exists an uplink solution where all noise covariances are equal, see Remark 2 in Section 3.For this special choice, the subspace Z is given by In the following, we show that Equation (94) can be expressed by this model.The constraint on the downlink transmit covariance is where Q = ∑ k∈K Q k and Z = ∑ k∈K Z k .In the following, we show that not only Equation (F4) implies Equation (F6), but both are equivalent.We do so by showing that if given Q = (Q 1 , . . ., Q K ), Q = ∑ k∈K Q k and Z that fulfill Equation (F6) we can construct a Z = (Z 1 , . . ., Z K ) with ∑ k∈K Z k = Z such that Equation (F4) holds.For the first K − 1 users, we select Z k as Z k = Q k − 1 K C , so that Equation (F4) is fulfilled for k = 1, . . ., K − 1, and we have By subtracting Equation (F7) from Equation (F6), we obtain and therefore Z ∈ Z , where Z is the orthogonal complement to C ⊕ Z ⊥ .Thus, if the constraint on the downlink transmit covariance is a constraint that solely acts on the sum of the transmit covariances, i.e., then the uplink has a solution where all noise covariances are equal.

Appendix G Details of the Worst Case Noise Approximation in the Broadcast
The optimization under a worst-case noise approximation is given by sup Assuming the optimal encoding order and considering that the constraint on the downlink transmit covariance is a constraint on the sum covariance Lemma 7, allows us to exchange infimum and supremum.The asymmetric mini-max duality by Lemma 3 translates the downlink problem to the following uplink constraints observe that the limit is independent of A, and when considering all possible choices for limit points, we can freely select B, C 0 as we can always select A such that S 0. If C is not strictly positive, S is not strictly positive and f is not differentiable.Therefore, the limit point of this sequence is not relevant.We conclude that Equation (H4) allows to parameterize all relevant limit points.
107) Apart from the obvious equalities C D = CD (α) α=1 and C U = CU (β) β=1 , the relationship between the original problem and the scaled problem is expressed by the following lemma: Lemma 8.

Table 1 .
Uplink and Downlink Optimality Conditions.