Scholarly article on topic 'Robust beamforming designs for multiuser MISO downlink with per-antenna power constraints'

Robust beamforming designs for multiuser MISO downlink with per-antenna power constraints Academic research paper on "Mathematics"

CC BY
0
0
Share paper
Academic journal
J Wireless Com Network
OECD Field of science
Keywords
{""}

Academic research paper on topic "Robust beamforming designs for multiuser MISO downlink with per-antenna power constraints"

0 EURASIP Journal on Wireless Communications and Networking

a SpringerOpen Journal

RESEARCH Open Access

Robust beamforming designs for multiuser MISO downlink with per-antenna power constraints

Feng Wang1, Yongwei Huang2, Xin Wang1* and Yu Zhu1

Abstract

This paper studies the robust beamforming designs for a multiuser multiple-input single-output (MISO) downlink system. Different from the conventional sum-power constraint across all transmit antennas, we consider individual power constraints per antenna at the base station. Assuming that the channel uncertainty is bounded by a spherical region, we develop the optimal robust designs to maximize the minimum worst-case signal-to-interference-plus-noise ratio (SINR) among all users. Specifically, we show that the optimal max-min SINR beamformers can be obtained by solving a sequence of "dual" min-max power problems. Relying on the S-procedure and the linear matrix inequality representation for the cone of Lorentz-positive maps (LPMs), respectively, two designs, which are referred to as Robust-SP and Robust-LPM, are proposed to efficiently solve such min-max power problems. Building on either Robust-SP or Robust LPM, a bisection search algorithm is then developed to find the robust max-min SINR beamformers with guaranteed global optimality and geometrically fast convergence speed. Using the max-min SINR solutions as a cornerstone, we further put forth the optimal robust design for the worst-case weighted sum-rate (WSR) maximization. By formulating the worst-case WSR maximization problem into a monotonic program (MP), we develop a polyblock outer approximation algorithm to obtain the globally optimal solution. Numerical results are presented to demonstrate the merits of the proposed robust beamforming designs.

Keywords: Lorentz-positive maps; MISO robust beamforming; Monotonic program; Per-antenna power constraints; Semidefinite program

1 Introduction

For a multiuser wireless downlink with multiple antennas at the base station (BS), transmit beamforming is a low-complexity solution to provide spatial diversity and to reduce co-channel interference [1]. Under the assumption of perfect channel state information (CSI), the optimal and suboptimal beamforming designs were developed to maximize the minimum user signal-to-interference-plus-noise ratio (SINR) [1-4] or to maximize the weighted sum of user rates [5-7]. However, perfect CSI is usually unavailable in practical systems due to many practical factors, such as inaccurate channel estimation, quantization of CSI, erroneous or outdated feedback, and time delays

Correspondence: xwang11@fudan.edu.cn: eeyw@ece.ust.hk

''The Key Laboratory for Information Science of Electromagnetic Waves (MoE),

the Department of Communication Science and Engineering, Fudan

University, 220 Han Dan Road, Shanghai, China

Full list of author information is available at the end of the article

or frequency offsets between the reciprocal channels. For these reasons, robust linear and nonlinear beamforming (precoding) designs to combat against channel uncertainty have received intensive research interests for different multi-user multiple-input multiple-output (MIMO) (single-/multi-cell downlink or relay) systems [8-19]. Generally, robust beamforming is addressed by either a stochastic or a worst-case approach. In the stochastic approach, the CSI uncertainty is often modeled as a random variable subject to a known probability distribution, and the robustness can be provided based on optimizing the average or the outage performance such as sum mean-square-error (MSE) [8] and weighted-sum-rate (WSR) [9, 10]. On the other hand, the worst-case approach assumes that the CSI lies in a bounded uncertainty region. In this case, the robustness is achieved by optimizing the system under the worst-case channel condition and

<£} Spri

© 2015 Wang et al. Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons

license, and indicate if changes were made.

it usually leads to a min-max or max-min problem formulation. With this approach, robust linear beamforming designs were developed for max-min SINR [11-16] or WSR maximization [17-19].

All the existing beamforming designs in [1-19] were developed under a sum-power constraint across all transmit antennas. However, in physical implementation of a multi-antenna BS, each antenna usually has its own power amplifier in the analog front-end, and it is individually limited by the linearity of this amplifier [20]. Hence, instead of the sum-power constraint, this leads to power constraints imposed on a per-antenna basis. Under such more realistic power constraints, the transmitter optimization was addressed in [20], where the elegant uplink-downlink duality under a sum-power constraint was extended to downlink problems with per-antenna power constraints. The robust sum-MSE minimizations with per BS antenna and per BS power constraints were investigated in [21] through the downlink-uplink duality. By establishing the MSE downlink-interference duality, the authors in [22] extended the work of [21] to solve the weighted sum-MSE minimization and min-max MSE problems under general power constraints for multiuser MIMO systems. Downlink beamforming designs under per-antenna power constraints were also addressed in some other works. Moore-Penrose zero forcing (ZF)-based beamforming design was derived to maximize the minimum user rate in [23]. Aiming to minimize the stochastic or worst-case sum-MSE, a nonlinear Tomlinson-Harashima precoding (THP) design was investigated in [24] under per-antenna power constraints. Based on block coordinate ascent and signomial programming methods, beamforming designs were put forth to maximize the WSR for a multiuser downlink with power constraints per antenna groups in [25]. For a large antenna array at the BS, an achievable rate for single-user multiple-input single-output (MISO) beamforming under per-antenna constant-envelop constraints was derived in [26]. With per-antenna array power constraints, the surrogate duality of the max-min beam-forming was investigated in [27].

In this paper, we investigate the robust transmit beam-forming designs for a MISO downlink with norm-bounded uncertain CSI at the BS. Under the per-antenna power constraints, the robust designs aim to maximize the minimum worst-case SINR among all users, or to maximize the worst-case WSR. The main contributions are summarized as follows:

• This paper shows that the robust max-min SINR beamformers can be obtained by solving a sequence of "dual" robust min-max power problems. Building on the solutions to these "dual" problems, an efficient bisection search algorithm can thus be applied to find the optimal max-min SINR solution.

• Two robust designs (i.e., Robust-SP and Robust-LPM) are developed to solve the "dual" robust min-max power problem. This problem is well-known nonconvex due to the infinitely many SINR constraints. For Robust-SP, we use the S-procedure to convert the problem into a rank-constrained semidefinite program (SDP), and then apply the SDP relaxation technique to find its (near-)optimal solution. Like [15], we give a computable CSI uncertainty bound which ensures the tightness of the SDP relaxation. For Robust-LPM, we consider a slightly conservative problem reformulation. Relying on a linear matrix inequality (LMI) representation for the cone of Lorentz-positive maps (LPMs), the new problem is shown to be equivalently transformed into a convex SDP which can be efficiently solved with guaranteed global optimality.

• We further put forth the robust beamforming for the worst-case WSR maximization and formulate this problem into a monotonic program (MP). Relying on solving a sequence of robust max-min SINR problems, a polyblock outer approximation algorithm is developed to find the globally optimal solution.

The remainder of this paper is organized as follows. Section 2 presents the system model. Section 3 introduces the proposed approach to the optimal max-min SINR beamforming design with perfect CSI. Section 4 gives the problem formulation of the optimal robust max-min SINR beamforming, and then develops Robust-SP and Robust-LPM to solve its "dual" min-max power problem. The robust design for the worst-case WSR maximization is presented in Section 5. Numerical results are provided in Section 6, followed by the conclusion in Section 7.

Notations: Uppercase and lowercase boldface letters denote matrices and vectors, respectively. All vectors are column vectors. Rn and Cn are the n-dimensional spaces of real and complex vectors, respectively. E[ •] denotes the expectation, (•)T is the transpose, (•)H is the Hermitian transpose, H is the absolute value, and || • || is the Euclidean norm of a vector. 0 and 1 are all-zero and all-one vectors of appropriate dimension, respectively. and I(•) denote the real part and imaginary part of the argument, respectively. The letter j represents the imaginary unit (i.e., j = V—T), while the letter i often serves as an index in this paper. In denotes an n x n identity matrix. A > 0 means that A is Hermitian and positive semi-definite, [ A]n,n is the (n, n)-th entry of A. tr(A) and rank(A) are the trace and rank of A, respectively. <g> denotes the Kronecker product. A circular symmetric complex Gaussian (CSCG) random vector a with mean a and covariance matrix T is denoted as a ~ CN (a, T). A U B and A n B denote the union and intersection of set A and set B, respectively.

A\B denotes the part of A that does not intersect with B. A C B denotes that A is contained in B. Finally, the element-wise (strictly) inequality for x, y is denoted as x < y (x < y).

2 Modeling preliminaries

Consider a wireless multiuser MISO downlink system where the BS equipped with M antennas simultaneously transmits K independent signals to K single-antenna users, as shown in Fig. 1. The baseband equivalent representation of the received signal at user k is expressed as:

yk = hH x + nk, Vk,

where hk e CM is the channel vector from the BS to user k, x e CM is the transmitted signal at the BS, nk ~ CN(0, o^) is the additive white complex Gaussian noise. Assuming that a linear beamforming strategy is employed at the BS, the transmitted signal x at the BS is then given by

x =T!k=1 wkSk,

[EK=i wkwj

< Pm, Vm.

Define W :=[ w1, •, wK], then the received SINR at user k in terms of W is given by

SINRk (W) =

|hj Wk |2

YK=U=k W wiI2 + at

3 Max-min SINR beamforming with perfect CSI

As a good starting point, we first develop an efficient approach to find the optimal beamformers that maximize the minimum SINR among all users under the per-antenna power constraints (3), when the perfect CSI is available at the BS.

Based on the SINRs in (4), we consider the following classic max-min SINR balancing problem:

max min

W 1<k<K

SINRk (W )

s.t. [ Eii Wk wH_

< Pm , Vm,

where yk > 0 is the prescribed SINR target for user k. Define the M x M square matrix Dm with

[ Dm]i,i :=

1, i = I = m, 0, otherwise.

The per-antenna power constraints of (5) are then rewritten as

EkLl wHDmWk < Pm, Vm,

where wk e CM and sk e C are the beamforming vector and the information signal for user k, respectively. Without loss of generality (w.l.o.g.), we assume that sk, Vk, has a unit power, i.e., E[ |sk|2] = 1.

Suppose that each transmit antenna has its own power constraint Pm, Vm. Given the beamformers wk, Vk, such per-antenna power constraints can be expressed as

which are convex quadratic inequality constraints with respect to wk.

Due to the nonconvexity of SINRk(W), the max-min SINR problem (5) is non-convex, and hence difficult to solve. Yet, we next show that it can be solved by alternatively solving the tractable "dual" per-antenna power balancing problems.

For a given scalar X > 0, as shown in [28], by introducing an auxiliary variable a, we formulate the following per-antenna power balancing problem:

a*(k) = min a

W, a ■^K

EK=i wj. Dmwk

SINRk (W )

< a, Vm,

> К Vk,

where the SINR constraints in (8) can be rewritten as:

, Vk. (9)

1 + -M Ihjwk I2 >

КYk) k

Observe that an arbitrary phase rotation can be added to the beamformers without affecting the SINRs. Hence, we choose phases such that hHWk, Vk, are real and nonnegative. By taking the square root operation for both sides of (9), the constraints then become convex second-order cone (SOC) (as known as Lorentz cone) constraints [29].

As a result, (8) can be reformulated into the following convex SOCP problem:

a*(k) = min a

• t. £K=i wHDmwk < aPm, Vm,

/1 + — hH wk >

which can be efficiently solved by interior-point methods with given parameter X [29]. Note that, with the given yk, Vk, the problem (10) may be infeasible for large positive X, since that the SINR constraints cannot be satisfied. In this case, we define the optimal value a*(X) := When (10) is feasible, we define W*(X) as the optimal solution to (10) for a given X. It can be shown that the function a*(X) obeys the following two properties1:

• Monotonicity: If 0 < Xi < X2, then a*(Xi) < a*(X2);

• Optimum condition: If it holds a* (X) = 1, then X and the corresponding W*(X) for (10) are the optimal value and the optimal solution for (5), respectively.

The two properties clearly indicate that the optimal solution of (5) can be obtained by solving the equation a*(X) = 1. Building on the solution for (10), an efficient bisection search algorithm can be then implemented to find the max-min SINR beamformers for (5) with guaranteed global optimality and geometrically fast convergence speed [28].

It is worth mentioning that the max-min SINR problem (5) can be equivalently formulated as a quasi-concave problem:

max k W

S. t.j! + hHWk >

Find W

s. t. J1 + hH Wk >

rhlH W

^wHDmWk < Pm,Vm.

We note that (10) and (12) correspond to a similar SOCP; hence, a similar computational effort is required to solve each instance of (10) and that of (12), practically using a software like CVX [29]. Also since that the similar bisectional search methods are applied in the proposed scheme and the feasibility check approach, it is expected that both algorithms can achieve the optimal solution of (5) after the same iterations. While the proposed scheme can solve the max-min SINR problem with similar computational complexity compared to the feasibility check approach, it provides a new and important insight for the close relationship between the max-min SINR problem and the min-max power problem in beamforming designs. This allows us to freely choose a more tractable form as the corner stone to pursue the optimal beam-forming designs under various important criteria such as rate maximization, MSE minimization, and bit-error-rate (BER) minimization, as detailed in Section 5.

4 Robust max-min SINR beamforming design

In this section, we generalize the approach in the perfect CSI case to the robust downlink beamforming designs where the BS has the bounded CSI uncertainty. We firstly formulate a robust max-min SINR beamforming problem and show that the optimal solution can be obtained by solving a sequence of its "dual" min-max power problems. An efficient bisection search algorithm is thus developed. Resorting to the S-procedure and the LMI representation for the cone of LPMs, respectively, Robust-SP and Robust-LPM are then proposed to solve these robust min-max power problems.

4.1 Robust max-min SINR beamforming problem

The downlink CSI uncertainty at the BS could be caused by estimation errors, feedback quantization, hardware deficiencies, and delays in CSI acquisition [11]. Motivated by these considerations, we assume the following additive error model:

^ w^Dmwk < Pm, Vm, k=1

where the phases of Wk, Vk, are chosen such that hHWk, Vk, are real and nonnegative. Clearly, (11) can be efficiently solved using a similar bisection search, where each step involves checking a convex feasibility problem with an updated X:

hk = h k + &k, Vk,

where hk is the estimated channel at the BS, and &k denotes the channel uncertainty. Similar to [11,13,15], we further assume that &k is bounded by a spherical region2:

Hk := |hk + Sk I J SH Sk < tk\, Vk,

where the real parameter > 0 specifies the radius of Hk.

Next, based on the CSI uncertainty region Hk, define the worst-case SINR for user k in terms of W as:

SINRk(W) := min

IhHWk I2

hke^TLuïk IhHwiI2 + oj

, Vk. (15)

We consider the robust designs aiming to maximize the minimum worst-case SINR among all users. By replacing

the SINRs in (5) with the worst-case SINRs in (15), we have the following robust max-min SINR balancing formulation:

X* = max min

SINRk (W)

W 1 <k<K Yk -K

s-t- EK=1 wHDmWk < Pm, Vm.

a*(X) = min max W 1<m<M

EK=1 Wk DmWk

SINRk (W) w/ s. t. -> X, Vk,

where Pm serves as a "power target" for antenna m and a*(X) denotes the optimal value of problem (17). Again the problem (17) may be infeasible for large nonnegative X. In this case, we define ct*(X) := +œ. As with the perfect CSI case, we can establish the following property:

Lemma 1. a* (X) is a strictly increasing function for X > 0.

Proof. Please see Appendix 1.

Let W * (X) denote the optimal beamforming matrix for (17) with the given X > 0. Relying on the monotonic-ity of ct*(X), we can further show the following close relationship between (16) and (17): □

Lemma 2. If it holds a*(X) = 1, then X and the corresponding W*(X) =[ wl(X), ■, w*K(X)] are the optimal value and the optimal solution for (16), respectively.

Proof. Please see Appendix 2.

Algorithm 1 for the max-min SINR beamforming problem

1: Initialize: Select a tolerance level S > 0;

2: Set Xmin = 0, Xmax = maxk

\\h k ll+lkk II

( Лт=1 pm

Again the problem (16) is nonconvex. It is worth mentioning that, like the perfect CSI case, (16) can be converted into a quasi-concave problem with the aid of the S-procedure and rank-relaxation, and the (near-)optimal solution can be found by iteratively checking the feasibility of an SDP. Here, we show that (16) can be solved by alternatively solving a sequence of the min-max power problems. For a given X > 0, we consider:

Repeat: Let X = (Xmax + Xmin)/2; Solving (17) to obtain a*(X) and W*(X); If a*(X) > 1, then Xmax = X; Else if a*(X) < 1, then Xmin = X; Until: (Xmax - Xmin)/Xmax < $. Output: X* = X and W* = W* (X).

SINR (W ) -= min

Yk №

\(h k + &k )H Wk |2

Yk EK=1,i=k \ (h k + 8k) wi \

(\\h k ll + llfk l\) 2(E M=1 Pm

, VW, Vk.

This implies that

X = max min

W 1<k<K

[SINRk (W) 1

(\\h k U + \k k\\) 2 (T M=1 Pm)

With such Àmin and Xmax, the bisection search requires O(\og2((Xmax - ^min)/5)) iterations (e.g., see [29] page 146) to solve ct*(X) = 1 up to a desired accuracy level, due to the monotonicity of ct*(X) with respect to X > 0. Clearly, Algorithm 1 converges to the optimal solution geometrically fast. Summarizing, we have the following proposition [29]:

Proposition 1. Algorithm 1 converges geometrically fast to the global optimal solution W* for (16).

To implement Algorithm 1, it is desirable to efficiently solve problem (17) with any given X > 0. Introducing an auxiliary variable a, we rewrite (17) as:

Similar to the perfect CSI case, Lemma 2 indicates that the optimal solution to (16) can be obtained by solving the equation a*(k) = 1. Therefore, a bisection search over k can be then implemented to obtain the robust max-min SINR beamformers. We describe it in Algorithm 1 in detail.

For Algorithm 1, an appropriate interval of k* should be determined. Obviously, kmin = 0, a lower bound of the interval. An upper bound kmax is determined as follows. It is clear that,

a*(X) = min a

s. t. EK=1 w'HDmWk < aPm, "Vm, SlNRk (W )

> X, Vk.

Although (19) is still non-convex due to the infinitely many SINR constraints, two efficient designs will be provided in the next two subsections.

4.2 The Robust-SP design

The basic idea of Robust-SP is to firstly convert (19) into a rank-constrained SDP by applying the well-known S-procedure [29, 30], and then the converted problem is (near-)optimally solved via the SDP relaxation [31].

Based on the definitions of Hk and SINRk, the constraints SINRk(W)/yk > X can be rewritten as:

Fk(Sk, V > 0 for all Sk such that SHSk < e|, Vk,

Fk(Sk, V) := (hk + Sk) x (hk + S^

H ( wk wH K

- J2 wiWi

i=i,i=k

t > 0,

A + tB c

cH d - t

Tk (X) := where tk > 0, Vk, and

Yk (X) + tkI Yk (X)h k

_h"k [ Yk(X)]H h"k Yk(X)hk - a\ - tk

Yk (X) := -LXk - V Xi, Vk. XYk i=u=k

Proposition 2. (Robust-SP) The problem (19) can be equivalently reformulated as a rank-constrained SDP:

à*(X) = min a

{Xk, tk, a}

s. t. EK=1 tr(DmXk) < aPm, Vm, Tk(X) h 0, tk > 0, Vk, Xk h 0, rank(Xk) = 1, Vk.

Next, we will show that the infinitely many constraints (20) have an equivalent LMI representation. To this end, we resort to the well-known S-procedure in optimization. This procedure provides an LMI representation for a robust quadratic constraint over an uncertainty set defined by one or two quadratic inequalities. For convenience, we cite the S-procedure in [30] and [29] below:

Lemma 3. (S-procedure) Let A and B be two n x n Hermitian matrices, c e Cn and d e R Then the following two conditions are equivalent:

(i) xHAx + cHx + xHc + d > 0 for all x e Cn such that xHBx < 1;

(ii) There exists a t e R such that

From Proposition 2, it is evident that, by dropping the rank-one constraints, Robust-SP (23) becomes an SDP which can be solved in a numerically reliable and efficient fashion [29]. Suppose X*k, Vk, are the optimal solutions to the SDP relaxation of (23). If X*k = w*kw*kH, Vk, i.e., the SDP relaxation is tight, then we obtain the optimal w*k, Vk, for (19). In fact, it was shown in ([15] Theorem 1) that the SDP relaxation under a sum-power constraint always admits a rank-one optimal solution when e_k, Vk, are sufficiently small. Likewise, we extend the approach to establish the following lemma for (23) under per-antenna power constraints:

Lemma 4. Suppose that for some choice of channel uncertainty bounds H = [ e1, •, eK]T, the SDP relaxation of (23) is feasible. Define the set

H(i) :=

f = [ ei, •, ck] I £k < ¿k, and e_k

By applying Lemma 3, problem (19) can be reformulated as an SDP with rank constraints. Define Xk := wkwkH, Vk. Then Xk > 0 and rank(Xk) = 1. Using the above S-procedure, (20) can be transformed as Tk(X) > 0 with respect to X:

Using the property that wHDmwk = tr(DmXk), we get the following equivalent SDP linear constraints:

YK=i tr(DmXk) < aPm, Vm. (22)

Until now, we are ready to show the following proposition:

XYkafminm(qm) VJI

< J-k—=-, Vk

V V(f) '

where qm, Vm, are the optimal Lagrange multipliers corresponding to the per-antenna power constraints in (23), and V(^/(Y^^ Pm) is equal to the optimal valuefor the SDP relaxation of (23) with given e. Then, for any vector e e ^(¿), we have rank(Xk) = 1, Vk.

Proof. Please see Appendix 3.

On the other hand, for the case of large e_k, Vk, the existence of rank-one optimal solutions for the SDP relaxation of (23) cannot be provably guaranteed. Hence, the exact optimal solution to (19) may not be constructed from Xkk with possibly a rank greater than one. In this case, randomization is a widely adopted method to obtain a feasible rank-one approximate matrix solution from the SDP relaxation. Specifically, a Gaussian randomization strategy [31] can be applied to get a vector wk from Xk, Vk, to nicely approximate the solution to (19). □

4.3 The Robust-LPM design

As shown in the previous subsection, when the CSI uncertainty bounds e_k, Vk, are small to some extent, the SDP relaxation of Robust-SP (23) is globally optimal. However,

it remains open whether (19) has an equivalent convex reformulation (i.e., there always exists a tight SDP relaxation) in general. As a compromise, we consider another interesting reformulation based on more conservative robust SINR constraints compared to those in (19).

The robust SINR constraints in (19) can be rewritten as:

h wk\ >

wkhkhkWi + a2, (25)

i—1,i—k

r h wk) >

wk hk hkk Wi + a\, (26)

i=i,i=k

* =[x1, ■,xn]T e Mn|x1 > + •••+ Xi | •

The real-valued 2M x 2M matrices Dm, Vm, are defined as

Dm : —

R(Dm) -I(Dm) I (Dm) R(Dm)

and the real-valued 2K x (2M + 1) matrices Bk(X, w), Vk, are Lorentz positive and satisfy that

Bk (X, w)yk e L2K, Vyk e L2M+1.

Given G = [g1, ■,gP]T (with P, Q > 3, gp e RQ, Vp = 1,.., P), A (G) is generated by the P arrow matrices {A(g1), ■,A(gp)j, i.e.,

'A(go) A(g3) A(g4) ■ A(gP)

A(g3) A(g-1) 0 ■ 0 A(g4) 0 A(g-i) ■ 0

A (G) :—

A(gp) 0

A(g-1)

for ||SkII < ek, where &k = hk — hk, Vk. Consider the following robust SINR constraints which appear a bit conservative:

where go = gi + g2, g-1 = gl - g2, gp = [ gpU gp2, gpQ]T, Vp, and

gpl + gp2 gp3 gp4 ■ gpQ

gp3 gpl - gp2 0 ■ 0

gp4 0 gpl - gp2 ■ 0

A(gp) :—

gp1 - gp2 .

for ||SkII < €k. Since R {hHwk) < |hHwk|, the set of wk defined by (26) is always contained in that by (25).

With the conservative SINR constraints (26), we consider the following robust beamforming problem formulation:

ot*(X) = min a

s. t. £K=1 wkDmWk < aPm, Vm, vfeR(hHwk) >7T,K=1,i=k wkhkhkwi + alVk, hk = hk + &k, V|| «k II<fk, Vk. ( 27)

The problem (2 7) is a semi-infinite SOCP and hence convex, but it is still not easy to be solved efficiently in the current form. Nevertheless, the conservative SINR constraints (26) can be reformulated as LPMs, where the set of each LPM actually forms a convex cone [32]. Furthermore, the recent elegant result in [33] shows that one can construct an LMI to describe a cone of LPM. Resorting to such an LMI representation, the intended beamforming problem (27) can be reformulated as a convex SDP.

To begin with, we define some notations. The n-dimensional SOC (which is also termed Lorentz cone) is defined as [33]:

With these notations, we can mimic the approach in [32] to show the following proposition.

Proposition 3. (Robust-LPM) The problem (27) can be reformulated as an SDP:

â*(X) — min a {Zk },w ,a

(Ik ® Dm)W

L2MK+1, Vm,

A (Bk (X, W)) + Zk h 0, Vk,

Zk e L

2K-1,2M

where w := [w^, wT2, ■, wKK1, wK2]T, wki = R(wk), wk2 = I (wk), Vk, and 12M denotes a linear subspace as in (58). ,

Proof. Please see Appendix 4.

Proposition 3 shows that the robust beamforming problem (27) can be reformulated as an equivalent SDP (29). We highlight that (29) can be efficiently solved using a handy solver (like SeDuMi [29]) with a guaranteed globally optimal solution. This is different in nature from the Robust-SP (23), where the original problem (19) is solved through the SDP relaxation technique (again noting that there is no mathematical proof for the zero gap between (19) and the SDP relaxation of (23) in general). Since more conservative SINR constraints are employed, it is clear that a*(X) > a*(X), i.e., the proposed Robust-LPM might yield a sub-optimal solution to (19). However, simulation results in Section 6 show that Robust-LPM can always provide an (near-)optimal solution.

Before leaving this section, we would like to remark that Robust-LPM (29) includes larger size matrices in the LMI constraints than Robust-SP (19), which means that the Robust-LPM has higher computational complexity than the SDP relaxation of Robust-SP (i.e., removing the

rank-one constraints). However, as a trade-off, the global optimality for Robust-LPM can be achieved while the global optimality for Robust-SP cannot be always guaranteed (i.e., there is a positive gap between the SDP relaxation and the problem itself). Both Robust-LPM and the relaxed Robust-SP can be efficiently solved by interior methods, practically using a software like CVX. According to Boyd and Vandenberghe ([29] Chapter 11.7), the computational complexities of the interior-point method for solving Robust-LPM and the relaxed Robust-SP are O(K7M6.5) and O (VKM + M2K3M6), respectively. □

5 Worst-case weighted sum-rate maximization

In this section, we extend the proposed approach to the optimal robust beamforming for the worst-case WSR maximization under per-antenna power constraints. Relying on the MP method [5-7, 16, 18, 19], we show that an efficient algorithm can be developed for the worst-case WSR maximization through solving a sequence of robust max-min SINR problems.

5.1 Problem formulation

With SINRk(W) = min%h

hH wk |

defined in

(15), the achievable worst-case rate of user k can be expressed as:

rk(W) = log2 (l + SlNRk(W)) bits/s/Hz.

Let ¡¡k denote the priority weight for user k. An optimization problem with the objective function of maximizing the worst-case WSR under the per-antenna power constraints can be formulated as:

nwx £k=i

1 + SINRk (W)

s.t. £fc=i wHDmWk < Pm, Vm.

where the feasible set is

Z := \z | 1 < zk < 1 + SlNRk(W), Vk, VW e w}. (33)

Since $ (z) is a strictly increasing function in each entry of z, the optimal solution z* for (32) must satisfy: z*k = 1 + SlNRk(W*), Vk, for a certain W* e W; and such W* is clearly the optimal solution to the original problem (31). Further define the following two sets

G := {z | 0 < zk < 1 + SlNRk(W), Vk, VW e w} ,

H := {z | zk > 1, Vk},

and let a(W) := 1 + S1NR1 (W),...,1 + SiNRk(W) for any W e W. Then G = UweW[ 0, a(W)] is the union of infinitely many normal boxes; clearly, G is normal [34]. Let b := [ b1,..., bK]T, where

bk := 1 +

2^m=1 1 m

(ih k y2

IKk ii

It clearly holds: 1 + SINRk(W) < bk, Vk. Therefore, G C [ 0, b] is a compact normal set with non-empty interior. It is also clear that H is a reverse normal set. It then follows that (32) is a standard MP [34]:

max $(z), s.t. z e (G n H),

The problem (31) is non-convex due to the heavily coupled mutual-interference terms in its objective function. However, it can be next converted to a standard MP problem over a norm set and can be solved efficiently.

Firstly, we introduce some definitions. A set S is called normal if z! < z and z e S implies z' e S; and a set S is called reverse normal if z' > z and z e S implies z' e S .A box [ a, b] is defined as the set of all z such that a < z < b. A vector y e R+ is an upper-boundary point of set S if ay e S, for any scalar a < 1, and ay e S, Va > 1. The set of upper-boundary points of S is called upper-boundary of S and it is denoted by d+S.

Now define the set W := {W | J2K=1 WHDmWk < Pm, Vm}. Introducing an auxiliary vector z =[ z1,..., zK ]T, we can equivalently reformulate (31) as:

max $ (z) := £K=1 ¡k log2 (zk), (32)

where we maximize an increasing function $ (z) over the intersection of a compact normal set G and a reverse normal set H. For the MP, the maximum is attained on d+(G n H).

5.2 The POA algorithm

Based on the separation property3 of normal sets [34], a polyblock outer approximation (POA) algorithm can be employed to efficiently find the globally optimal solution for an MP. For any finite vector set T := {vi, i = 1,..., I}, the union of all the boxes [ 0, v,], Vi, is a polyblock. The basic idea is to approximate the feasible set G n H by a polyblock. Specifically, we construct a nested sequence of polyblocks: P1 D P2 D ••• D Pn D ••• D G n H in such a way that maxzepn $(z) \ maxze(en«) $(z),wherePn denotes the polyblock generated at the nth iteration and "\" denotes convergence from above.

A vertex vi e T is called proper if there does not exist another vj e T such that Vj > vi. The maximum of an increasing function over a polyblock is attained at one of its proper vertices. Hence, at the nth iteration, the maximizer for $ (z) over Pn is obtained as:

zn := arg max &(z),

where Tn is the (finite) proper vertex set of Pn. Note that zn can be simply obtained by searching over the finite entries of Tn. If zn e (G n H), then it solves (35).

Otherwise, we construct the next polyblock Pn+1 contained in Pn\{zn} but still enclosing G n H, and continue the process.

To construct new polyblock Pn+1 from Pn, it requires computing the projection point ng(zn), which is defined as the unique point where the halfline from 0 through z meets d+G, i.e., ng (z) — Xz and X — max{a | az e G}• Let yn — y, ■,ynKf :— ng (zn), and

znk := zn - {4 - yD ek, Vk,

Xn = max min

W 1<k<K

l+SINRk (W )

s.t. EK=1 wkDmwk < Pm, Vm,

and its "dual" min-max power problem with given Xn is

EK=1 w^ Dmwk Pm

Pm (39)

ä*(X) = min max

W 1<m<M

s.t. l+SINRkiW) > n vk.

Problem (39) can be solved either by Robust-SP in Section 4.2 or by Robust-LPM in Section 4.3. The proposed Algorithm 1 can be applied to find the optimal value Xn for (38).

The proposed POA algorithm to find an f -optimal solution for (31) is summarized in Algorithm 2. A key requirement for provable convergence is that z is lower bounded by a strictly positive vector [34]. Since z > 1 > 0 in (32), it readily follows from ([34] Theorem 1) that:

where ek is a unit vector with the only non-zero number (i.e., "1") in the kth entry. Hence, zn,k can be obtained through replacing zn by y^ and yn < zn,k < zn, Vk.

Let Tn+1 be the set obtained from Tn by replacing the vertex zn with K new vertices zn,k and then removing the improper vertices; i.e., Tn+1 = (Tn\{zn}) U {zn,k | zn,k is proper}. Since z* e H, we can further reduce the vertex set Tn+1 = Tn+1 0 H. With such a vertex set Tn+1, we have ([34] Proposition 17):

Lemma 5. The polyblock Pn+1 with vertex set Tn+1 satisfies (G 0 H) C Pn+1 C Pn.

Lemma 5 provides the direction for construction of Pn+1 from Pn to approximate (33) from outside with increasing accuracy. To this end, we need to find yn = ng (zn) = Xnzn, which is determined by solving:

Xn = max {a | azn e G}

= ma^j a | a < mim<k<K 1+S^W), VW e W

= maxwew mim<k<K 1+*iW).

This leads to the following max-min SINR balancing problem:

Proposition 4. Algorithm 2 globally converges to an Ç-optimal solution for (31) and (32).

Algorithm 2 for the worst-case WSR Maximization (31)

1: Initialize: Select a tolerance level ^ > 0;

2: Let n = 0, T0 = {b}, and CBV (current best value) = 0.

3: Repeat:Let zn = argmaxzerK ®(z);

4: For zn, use Algorithm 1 to solve (38) to obtain Xn, the corresponding W*, as well as yn = Xnzn.

5: If yn e H and $(yn) > CBV, then CBV = $(yn), z = yn, and WW = W*.

6: Let zn,k ={ zn — (znk — yf) ek, Vk, and Tn+1 = [(Tn\{zn}) U {zn,k | znk is proper}] 0 H.

7: Further remove from Tn+1 any vi e Tn+1 satisfying $(vi) < CBV(1 + f).

8: Set n = n + 1.

9: Until Tn = 0.

10: Output: z as the f -optimal solution for (32) and WW the solution for (31).

Proposition 4 establishes that Algorithm 2 can yield the optimal beamformers for (31) with guaranteed convergence and global f -optimality. Note that the worst-case WSR maximization (31) is in fact NP-hard. The proposed POA method (i.e., Algorithm 2) is essentially a smart branch-and-bound approach, which does not have a worst-case polynomial-time complexity [34]. However, extensive numerical examples have shown that this type of algorithm can solve general MP problems of dimensions 10-15 (while the problems of such dimensions are already very hard to solve by the standard approximation tools) [5, 6, 35]. For those small/medium size problems, the complexity with the algorithm may be affordable for practical implementation. On the other hand, for problems with even larger dimensions, the algorithm may be only suitable for benchmarking purposes.

It is worth noting that similar POA algorithms were adopted to find the optimal beamforming designs for the WSR maximization in other different setups [6, 7, 18, 19, 35]. The proposed Algorithm 2 can be also applied to the optimal robust beamforming designs under other general criteria where the objective functions, e.g., the sum of mean square errors or sum of bit error rates, are monotonic functions of the SINRs; see a unified framework [18, 35].

6 Numerical results

6.1 Simulation setting

Consider a MISO downlink system where the BS, equipped withM antennas, serves K single-antenna users. Each transmit antenna has an equal power budget, i.e.,

Pm = P/M, Vm, where P is the total power budget at the BS. Assume a normalized channel estimation hk ~ CN(0,IM). The CSI uncertainty bound = e\\hkII, Vk, for a given e in (14). We assume that nk ~ CN(0, a2), Vk, and a2 = 0.1. Define SNR = P/a2, and each user has an equal SINR target, i.e., Yk = SNR/K, Vk. The tolerance levels are set as S = 0.01 and f = 0.01 in Algorithms 1 and 2, respectively.

6.2 Properties of a(X), a (X), and a (X)

For one given channel realization with M = 4 and K = 3, Fig. 2 shows the curves of the per-antenna min-max power functions a*(X) in (10) with perfect CSI, a*(X) in (23) of Robust-SP, and a* (X) in (29) of Robust-LPM with respect to the SINR-to-target ratio requirement X. The input SNR is chosen as SNR = 10 dB, and the channel uncertainty bound norm is e = 0.2. The monotonicity of a*(X), a*(X), and a* (X) is clearly shown in Fig. 2. Robust-SP and Robust-LPM achieve almost the same value., i.e., a*(X) & a*(X). It shows that the values of a*(X) are smaller than those of the robust ones which consider the channel uncertainty. It means that the robust beamform-ing design requires more power than the beamforming design with perfect CSI under the same SINR constraints to account for the CSI uncertainty. Besides, as discussed in Sections 3 and 4, the optimal beamforming designs can be obtained by solving a*(X) = 1, a*(X) = 1, or a* (X) = 1.

6.3 Average minimum SINR

To gauge the average minimum SINR performance of different designs with uncertainty CSI, we realize 100 independent simulation runs. For each simulation run, we first generate hk, Vk, randomly. Based on (13) in Section 4.1,

we obtain 1000 true channel realizations hk = hk + &k (where ||5kII < e\\hk\\), and compute the average minimum SINR over the channel realizations for each input SNR. Then, the SINR results are averaged over the 100 simulation runs. Figures 3 and 4 demonstrate the average minimum SINR performance among K = 3 users for M = 4 and M = 6, respectively, where e = 0.2. It is observed that the proposed Algorithm 1 based on Robust-LPM achieves almost the same average minimum SINR performance as that based on Robust-SP.

We also evaluate the rank-relaxation method in [16] under per-antenna power constraints, where the robust beamformers are obtained using a bisection search with the aid of SDP and rank-relaxation, and all the iterations that return rank-one solutions are stored. In Figs. 3 and 4, we observe that Robust-SP/Robust-LPM significantly outperforms the method of [16] in high SNR regimes. For example, at SNR = 10 dB in Fig. 3, the proposed designs achieve about 4 dB greater SINR gains than the method of [16]. It implies, in high SNR regimes, the tightness of rank relaxation becomes invalid, and thus a randomization is necessary. This is also shown in Lemma 4, when SNR (which is proportional to V(e)) increases, the CSI uncertainty set that guarantees the tightness becomes smaller.

In addition, the performances of NonRobust design, the minimum mean square error (MMSE) design in [4], and the Moore-Penrose ZF design in [23] are also included in Figs. 3 and 4. For these three designs, although the true channel is hk, the calculation of beamformers is processed by regarding the estimated channel hk as the true channel. Note that in order to implement the Moore-Penrose ZF beamforming design, we assume that M > K. The optimal

Fig. 2 Illustration of a* (J.) in (8), à*().) in (23), and a* (X) in (29), M = 4, K = 3,SNR=10dB

-10 -5 0

Fig. 3 Average minimum SINR vs SNR with e = 0.2, M = 4, and K = 3

SNR [dB]

performance under perfect CSI is also provided as an upper bound for all designs. Figures 3 and 4 show that the proposed Robust-SP and Robust-LPM designs outperform NonRobust in the whole SNR regimes. This is expected because NonRobust regards the estimated channel hk as the true CSI hk in calculating the beamformers. If the perfect CSI were available, the more "aggressive" NonRobust would have yielded a higher average minimum user SINR than the robust ones (since the robust designs are conservative in the sense that they aim to provide the worse-case guarantees). However, in the presence of the CSI uncertainty, the performance of NonRobust degrades dramatically at most of times since that pretty small

perturbations of uncertainty data can make the nominal optimal solution heavily infeasible and thus meaningless.

The proposed robust designs clearly achieve a larger gain in the average minimum SINR performance than the MMSE and Moore-Penrose ZF designs as shown in Figs. 3 and 4. For example, at SNR = 0 dB, the Robust-SP and the Robust-LPM designs with M = 4 achieve about a 4 dB gain in the average minimum SINR performance when compared to the MMSE design. Lastly, we observe that the average minimum SINR performance improves when the number of transmit antennas grows. This is because more antennas lead to more accurate beamformers matched with channel characteristics.

-10 -5 0

Fig.4 Average minimum SINR vs SNR with e = 0.2, M = 6, and K = 3

SNR [dB]

Next, we evaluate the average minimum SINR performance of various designs under different CSI uncertainty norm bounds with SNR = 5 dB and K = 3. Figure 5 demonstrates the average minimum SINR performance for M = 4 and M = 6. Again, it is seen that the proposed Robust-LPM achieves almost the same performance as the proposed Robust-SP. As expected, the average minimum SINR decreases as the channel uncertainty norm bound e increases. For example, the average minimum SINR of the proposed two designs when e = 0.5 is about 1 dB smaller than those when e = 0.1.

6.4 Average WSR maximization

Figure 6 shows the average WSR values of different designs with e = 0.2, M = 4, and K = 3. The weights are n = 0.2, ¡¡2 = 0.3, and ¡¡3 = 0.5. The proposed worst-case WSR maximization beamformers are obtained via Algorithm 2 with f = 0.01. "Robust-SP" and "Robust-LPM" in Fig. 6 denote the max-min SINR solutions in Algorithm 2 are obtained through Algorithm 1 based on Robust-SP and Robust-LPM, respectively. It is observed that the WSR maximization design based on Robust-SP slightly outperforms the one based on Robust-LPM, where the corresponding WSR gap is smaller than 0.1 bits/s/Hz in the SNR regimes of consideration. For comparison, we also demonstrate the performances of the WSR maximization beamforming designs for which the max-min SINR solutions are respectively obtained based on the NonRobust design, the MMSE design [4] and the Moore-Penrose ZF design [23]. As shown in Fig. 6, the proposed robust WSR maximization designs achieve significantly higher average WSR, compared to the NonRobust,

MMSE, and Moore-Penrose ZF ones in the medium and high SNR regimes. For example, at an SNR of 10 dB, the proposed Robust-SP achieves about 0.2 bits/s/Hz and 0.6 bits/s/Hz more average WSR over the NonRobust design and the Moore-Penrose ZF design,respectively.

7 Conclusions

Under the per-antenna power constraints, we proposed an efficient approach to find the robust max-min SINR beamforming designs by solving a sequence of min-max power problems. We developed Robust-SP and Robust-LPM for the robust min-max power problems. Building on the min-max power solutions, a bisection search algorithm was developed to obtain the robust max-min SINR beamformers. Using the max-min SINR solution as a cornerstone, we further proposed an MP method to find the robust beamformers for the worst-case WSR maximization with guaranteed convergence and global optimality. Numerical results demonstrated that the proposed robust designs provide substantial performance improvement over the existing alternatives.

8 Appendices

8.1 Appendix 1: Proof of Lemma 1

Let W =[ w1, ■, w{\ be the optimal solution for (17) with

[eLi wk n1

X > 0, such that ä*(X) = max1 <m<M ■

SINRk (W )

For another X' e[0, let fi = X'/X. It is clear: 0 < 1. we can show that Vfi W is in the feasible set of (17) with X'. This is because: V/c,

+ Robust-SP O Robust-LPM A NonRobust □ MMSE

[> Moore-Penrose ZF

— - - ■ M - 4 M - 6

.1 0.2 Fig. 5 Average minimum SINR vs e with SNR = 5 dB and K = 3

Fig. 6 Average WSR of different beamforming designs with e = 0.2, M = 4, and K = 3. = 0.2, ii2 = 0.3, and = 0.5

SINRk (.J? W )

p\h% * k I2

heHk T,f=k,l=i (P\hHwI2) + a

p\hH w k I2

hk eHk£f=w=1 (\h% w t\2) + a\ On the other hand, we have

[Eii (jPWk

> px = k'.

= p max

1 (wkwH)

= pà*(X).

Eii Wk (X) wk (X)

EiiW *k(X )

< max -

Wk (x )

= ak(x ) = 1,

X* > min

SINRk (W *(X )) Yk

Let W* =[ w*, ■, w*K] be the optimal solution of (16). We can show that W* is in the feasible set of (17) with X* as

the minimum SINRk(W) requirement. This is because X* = min1<k<K SINY(W ), or equivalently, sinry(w ~> > x*, Vk. On the other hand, we have ^K=1 w*k [wk]H Vm. Therefore, we have

a*(X*) < max

[EK=1 wk [wk]H

By Lemma 1, a*(X) is a strictly increasing function of X > 0. The inequality X* > X in (41) implies:

Therefore, we must have a*(X') < pa*(X). It is easy to see that a*(X) > 0 for any X > 0. It in turn implies that

a*(X') < Pa*(X) < a*(X) for 0 < X' < X.

8.2 Appendix 2: Proof of Lemma 2

Since for all m = 1, •, M,

a*(X*) > a*(X) = 1.

then the beamforming matrix W* (X) is in the feasible set of (16). This implies:

We have both (42) and (43) only when all the inequalities are satisfied with equality, i.e., X* = X and W* = W*(X).

8.3 Appendix 3: Proof of Lemma 4

We first derive the dual of the downlink beamforming problem (23) without rank-one constraints. For convenience of analysis, we scale the objective function of (23) with £M=i Pm, so that the objective of minimization is the total transmission power Pm. Therefore, the

problem of interest is expressed as:

m=1 Pm

{Xk tk, a}

s. t. ££=1 tr(DmXk) < aPm, Vm, Tk(X) > 0, tk > 0, Vk, Xk > 0, Vk.

It is evident that problem (P€) and the SDP relaxation (23) have the same feasible region and the same optimal

solution. We introduce the following dual variables for the corresponding constraints as shown in Table 1.

Let Q = diag(#1, •, qM) and $ = diag(P1, •, Pm), then the dual of this SDP is given by

max £K=1 ak {Q,G/ dk ,fik,} k 1 k

s. t.tr($) > tr(Q$), Q > 0, Gk dk

idH ßk

Zk := Q - XYk

> 0, Vk,

1k (Gk + dkhk + hk d" + ßk h khk Ti=k (Gl + dih" + hidk + ßihh") > o, vk,

Ck := ßk4 - Tr(Gk) > 0, Vk.

= [Gk - ß- dk dk) + dk + Vßhk

x dk + Sßh^j > 0, Vk.

Table 1 Dual variables and their corresponding constraints

Dual variable

Constraint

qm Uk Ck Zk

£k=1 tr(DmXk) - aPm < 0 Tk(X) h 0 tk > 0 Xk h 0

Additionally,

2 V(e) 2 V(ê) 2

TrGk) < ßk4 < < ^el

Jk Ok Im t

V(e) XYk minm qm < —---TT—:-= XYk min qm.

V (e )

This implies that Gk) < minm qm, which leads to

Q - — Gk > 0.

Therefore, the rank(Zk) is calculated as: — ^ —

XYk ) XYk

rank(Zk) = rank ( ( Q - Gkj + a dkdk

Note that the CSI uncertainty bounds e =[ei, •, eK]T and X are regarded as the given parameters for both the primal problem (Pe) and its dual (De). Suppose {Xk, tk, a} and {Q, Gk, dk, fik} are the optimal solutions of (Pe) and (De), respectively. Similar to the discussions in [15, 20], we have:

• Problem (De) is always strictly feasible;

• Suppose the primal problem (Pe) is feasible, then strong duality holds true for the prime (Pe) and its dual (De);

• fik > 0, Vk;

• Gk + dkh^ + h kdk + fikh kh"k > 0, Vk;

• rank(Xk) > 1, Vk.

For any e =[ e1, •ek]T e Q(e), there is e/ < ek, Vk. This follows that any feasible point of (Pe) must be a feasible point of (Pe). Hence, (Pe) is solvable. Let V(e) denote the optimal value of (Pe) (or its dual (De)). It is clear that

V(e) < V(e). (44)

Now, to establish rank(Xk) = 1, we use the complementary slackness condition Tr(X/Z/) = 0 and prove rank (Zk) = M — 1. According to the aforementioned properties, we have fik > 0 and

kk Gk + dk hk + h k dk + fikh k hk

+ J2 (Gl + dih" + h dk + ßih h

1 1 \k\

dk + Jßh k )( dk + Jßh kj

> M - 1,

where the last inequation holds true due to the fact that rank ( dk + Vfihk)(dk + Vfi^)^ = 1. Recalling the complementary slackness conditions tr (XkZk) = 0 and rank(Xk) > 1, Vk, we obtain rank(Zk) = M — 1 and rank(X k) = 1, Vk.

8.4 Appendix 4: Proof of Proposition 3

Firstly, we define wk := w/1 + jwk2 (i.e., w/1 = R(wk), and w/2 = I(wk)). Likewise, we have hk := hk1 + jhk2 and 8k:= % +jSk2. Define Wk,1 :=[wn, •, w/—1,1, Wk+1,1, •, wk 1] e RMx(K—11) and W/,2 :=[ W12, •, w/—1,2, Wk+1,2, •, Wk2] e RMx(K—1). Let w :=[ w^, w[2, •, w^, w|2]T and define K real 2K x 2M matrices in terms of X and W as

Ck (X, w) :=

Wk1 W k,1 Wk,2 0

W/2 Wk,2 — Wk,1 0_ and K real 2K-dimension vectors in terms of X and WW as

, Vk, (49)

ck (X, w) := Ck (X, w)

The robust SINR constraints (26) can be then written as

Ck (X, W )

+ ck (X, WW) e L2^+2, V

< ek. (51)

Further define K real 2K x (2M + 1) matrices as Bk (X, w) := [ck (X, w) ek Ck (X, w)~\, and lk := [ 1 ST1 ST2 ]T e R2M+!, Vk.

Note that Ck(X, WW) and ck(X, WW) are affine with respect to Wk, Vk; so are Bk(X, WW), Vk. Then (51) becomes

Bk(X, W)ïk e L2K, VSk e L2M+1 Vk.

D m :—

R(Dm) —I(Dm) I (Dm) R(Dm)

The per-antenna power constraints (7) are recast as SOCs:

(Ik ® dm)w

L2MK+1, Vm,

where we use the fact that Dm = Dm.

Then (27) is transformed as the following real-valued optimization problem:

iî*(X) — min a

L2MK+1, Vm,

(Ik <S> dm)WW_ Bk(X, W)8k e L2K, VSk e L2M+1, Vk.

xTBk (X, W)yk > 0, Vxk e L2K, Vyk e L2M+1.

Lp,Q :—

Mn • M1P'

MP1 • MPP

I Mp? e 5 (Q)

It is evident that Lp,q c 5(PQ). The orthogonal complement of Lpq within 5(PQ) is the [ PQ(P — 1) (Q — 1)/4]-dimension subspace LPq, where

f± — lp,q —

' Mu • M1P

MP1 • MPP

I Mp? e ^(Q)

In order to solve (55), let us first deal with the robust SOC constraints (i.e., the second group of constraints therein). For a given X > 0, define set Bk as

Bk := {Bk(X, w)\Bk(X, w)yk e L2K,Vyk e L2M+1}, Vk.

It can be seen that Bk contains linear maps taking L2M+1 to L2K. In other words, Bk is the set M of LPMs such that M[L2M+1] c L2K.

Lemma 6. The set Bk consists of all Lorentz-positive matrices Bk(X, w), i.e.,

It is clear that S(PQ) = Lp,q ® Cp q, where ® denotes the direct sum of vector spaces. By these definitions, it can be seen that:

S+ (P) ® S+(Q) c Cpq, A(P) ® A(Q) c CpQ. (59)

We recall the notation for A(■) in (28) and cite Theorem 5.6 in [33] as a lemma (see also [32], Lemma 3.2):

Lemma 7. LetminjP, Qj > 3. Then a matrix G e is Lorentz-positive, if and only if there exists X e A(P — 1) <g> A(Q — 1) such that

A (G) + X ^ 0. (60)

Based on (59) and Lemma 6, we can derive an equivalent condition for the Lorentz-positive Bk(X, w) in Bk as follows.

Proposition 5. For a given X

positive if and only if there is Zk e 1, A(Bk(X, WW)) + Zk > 0, Vk.

0, Bk(X, W) is Lorentz such that

Proof. It immediately follows from the fact that a Lorentz cone is self-dual [29].

Clearly, the set Bk is a closed convex cone, and it thus has an LMI description [33]. With such a convex LMI description of Bk, we are able to formulate the problem (55) into a standard SDP problem. For that purpose, we need to introduce some notations and facts as follows.

Let S (n) and A(n) be the spaces of real symmetric and skew-symmetric n x n matrices, respectively. 5+ (n) is the cone of positive semidefinite matrices in S(n). Let Cp,q denote the [PQ(P + 1)(Q + 1)/4]-dimension linear space of biquadratic forms [36]:

Proof. The proof follows immediately from ([32] Proposition 3.3) and the observation in ([32] Equation (27)), and thus we omit it here.

We note that Bk (X, w) and A (Bk (X, w)) (for a given X > 0) are affine with respect to the design variable w, and that CpK_ 12M is a linear subspace of symmetric matrices with skew-symmetric blocks. It follows that (61) is an imple-mentable LMI description for Bk (X, w). Therefore, we obtain the following equivalent convex SDP reformulation of (55):

a*(X) —

{Zk },w ,a

(Ik ® Dm)W

L2MK+1, Vm,

A(Bk(X, WW)) + Zk > 0, Vk,

Zk e L2K—1,2M, Vk.

Now we complete the proof of Proposition 3.

Endnotes

1The proof can be found in our conference version [28]. 2 It can be ready to extend the results under the assumption of the spherical uncertainty region to the

ellipsoidal region case: E/ := |h/ + 8/ | 8kB/8/ < e^j, where B/, Vk, are positive definite matrices.

3 Analogous to the separation property of convex set, any point z outsides a normal set can be separated from the normal set by a cone congruent to the nonnegative orthant. Thus, a normal set can be approximated as closely as desired by a nested sequence of polyblocks.

Competing interests

The authors declare that they have no competing interests. Acknowledgements

This work was supported in part by China Recruitment Program of Global Young Experts, the Program for New Century Excellent Talents in University, National Natural Science Foundation of China under Grant No. 61271223, and the National Science and Technology Major Project of the Ministry of Science and Technology of China under Grant No.2012ZX03001013.

Author details

1The Key Laboratory for Information Science of Electromagnetic Waves (MoE), the Department of Communication Science and Engineering, Fudan University, 220 Han Dan Road, Shanghai, China. 2Department of Mathematics, Hong Kong Baptist University, Hong Kong, China.

Received: 10 February 2015 Accepted: 21 July 2015 Published online: 16 August 2015

References

1. M Bengtsson, B Ottersten, in Handbook of Antennas in Wireless Communications, ed. by L Godara. Optimal and suboptimal transmit beamforming (CRC Press, New York, 2001)

2. M Schubert, H Boche, Solution of the multiuser downlink beamforming problem with individual SINR constraints. IEEE Trans.Veh. Technol. 53(1), 18-28 (2004)

3. A Wiesel, YC Eldar, S Shamai, Linear precoding via conic optimization for fixed MIMO receivers. IEEE Trans. Signal Process. 54(1), 61-176 (2006)

4. H Lee, I Sohn, D Kim, K-B Lee, in Proc. IEEE ICC. Generalized MMSE beamforming for downlink MIMO systems, Kyoto, Japan, 2011

5. L Qian, Y Zhang, J Huang, MAPEL: Achieving global optimality for a non-convex wireless power control problem. IEEE Trans. Wireless Commun. 8(3), 1553-1563 (2009)

6. L Liu, R Zhang, K-C Chua, Achieving global optimality for weighted sum-rate maximization in the K-user Gaussian interference channel with multiple antennas. IEEE Trans. Wireless Commun. 11 (5), 1933-1945 (2012)

7. W Utschick, J Brehmer, Monotonic optimization framework for coordinated beamforming in multicell networks. IEEE Trans. Signal Process. 60(4), 1899-1909 (2012)

8. C Xing, S Ma, Y Wu, Robust joint design of linear relay procedure and destination equalizer for dual-hop amplify-and-forward MIMO relay systems. IEEE Trans. Signal Process. 58(4), 2273-2283 (2010)

9. X He, Y Wu, Probabilistic QoS constrained robust downlink multiuser MIMO transceiver design with arbitrary distributed channel uncertainty. IEEE Trans. Wireless Commun. 12(12), 6292-6302 (2013)

10. K-Y Wang, AM-C So, T-H Chang, W-K Ma, C-Y Chi, Outage constrained robust transmit optimization for multiuser MISO downlinks: Tractable approximations by conic optimization. IEEE Trans. Signal Process. 62(21), 5690-5705 (2014)

11. M Shenouda, T Navidson, Convex conic formulations of robust downlink precoder designs with quality of service constraints. IEEE J. Sel. Topics Signal Process. 1(4), 714-724 (2007)

12. G Zheng, K-K Wong, T-S Ng, Robust linear MIMO in the downlink: A worst-case optimization with ellipsoidal uncertainty regions. EURASIP J. Adv. Signal Process. 2008,1-15 (2008)

13. N Vucic, H Boche, Robust QoS-constrained optimization of downlink multiuser MISO systems. IEEE Trans. Signal Process. 57(2), 714-725 (2009)

14. N Vucic, H Boche, S Shi, Robust transceiver optimization in downlink multiuser MIMO systems. IEEE Trans. Signal Process. 57(9), 3576-3587 (2009)

15. E Song, Q Shi, M Sanjabi, R Sun, Z-Q Luo, Robust SINR-constrained MISO downlink beamforming: When is semidefinite programming relaxation tight? EURASIP J.Wireless Commun. Netw. 2012,1687-1499 (2012)

16. G Zheng, K Wong, B Ottersten, Robust cognitive beamforming with bounded channel uncertainties. IEEE Trans. Signal Process. 57(12), 4871-4881 (2009)

17. A Tajer, N Prasad, X Wang, Robust linear precoded design for multi-cell downlinktransmission. IEEETrans.Signal Process. 59(1), 235-251 (2011)

18. E Bjornson, G Zhang, M Bengtsson, B Ottersten, Robust monotonic optimization framework for multicell MISO system. IEEE Trans. Signal Process. 60(5), 2508-2523 (2012)

19. M Hanif, L-N Tran, A Tolli, M Juntti, S Glisic, Efficient solutions for weighted sum rate maximization in multicellular networks with channel uncertainties. IEEE Trans. Signal Process. 61(22), 5659-5674 (2013)

20. W Yu, T Lan, Transmitter optimization for multi-antenna downlink with per-antenna power constraints. IEEE Trans. Signal Process. 55(6), 2646-2660 (2007)

21. TBogale, L Vandendorpe, Robust sum MSE optimization for downlink mulituser MIMO systems with arbitrary power constraint: Generalized duality approach. IEEE Trans. Signal Process. 60(4), 1862-1875 (2012)

22. T Bogale, L Vandendorpe, Linear transceiver design for downlink multiuser MIMO systems: Downlink-interference duality. IEEE Trans. Signal Process. 61 (19), 4686-4700 (2013)

23. K Karakayali, R Yates, G Foschini, R Valenzuela, in Proc. IEEEISIT. Optimum zero-forcing beamforming with per-antenna power constraints, Nice, France, 101-105 (2007)

24. P Ubaidulla, A Chockalingam, in Proc. IEEE WCNC. Robust THP transceiver designs for multiuser MIMO downlink, Budapest, Hungary, 2009

25. M Codreanu, A Tolli, M Juntti, M Latva-Aho, in Proc. IEEE VTC-Spring. MIMO downlink weighted sum rate maximization with power constraints per antenna groups, Dublin, Ireland, 2048-2052 (2007)

26. S Mohammed, E Larsson, Single-user beamforming in large-scale MISO system with per-antenna constant-envelop constraints: the doughnut channel. IEEE Trans. Wireless. Commun. 11(11), 3992-4005 (2012)

27. G Dartmann, X Gong, W Afzal, G Ascheid, On the duality of the max-min beamforming problem with per-antenna and per-antenna-array power constraints. IEEE Trans. Veh. Technol. 62(2), 606-619 (2013)

28. F Wang, X Wang, Y Zhu, in Proc. IEEE ICC. Transmit beamforming for multiuser downlink with per-antenna power constraints, Sydney, Australia, 2014

29. S Boyd, L Vandenberghe, Convex Optimization. (Cambridge University Press, Cambridge, UK, 2004)

30. I Polik, TTerlaky, A survey of the S-lemma. SIAM Rev. 49(3), 371-418 (2007)

31. Z-Q Luo, W Ma, A So, Y Ye, S Zhang, Semidefinite relaxation of quadratic optimization problems. IEEE Signal Process. Mag. 27(3), 20-34 (2010)

32. Y Huang, D Palomar, S Zhang, Lorentz-positive maps and quadratic matrix inequalities with applications to robust MISO transmit beamforming. IEEE Trans. Signal Process. 61(5), 1121-1130 (2013)

33. R Hildebrand, An LMI description for the cone of Lorentz-positive maps II. Linear Multilinear Algebra. 59(7), 719-731 (2011)

34. H Tuy, Monotonic optimization: Problems and solution approaches. SIAM J.Optim. 11 (2), 464-494 (2000)

35. Z Fang, X Wang, X Yuan, Beamforming design for multiuser two-way relaying: a unified approach via max-min SINR. IEEE Trans. Signal Process. 61 (23), 5841-5852 (2013)

36. Z-Q Luo, J Strum, S Zhang, Multivariate nonnegative quadratic mappings. SIAM J. Optim. 14(4), 1140-1162 (2004)