Resource Management Algorithm Design Clause Samples
Resource Management Algorithm Design. The optimization problem in (4.7) is non-deterministic polynomial-time (NP)-hard due to the non-convexity of the constraint C1, the l0-norm in the first term of the objective function and C[fronthaul] in the constraint C6. By using convex relaxation technique [11], the l0-norm term in the objective function of (4.7) and C6 can be approximated by their weighted l1-norm, respectively, as follows i∈Li i∈Li P[coop] ≈ ∑ ¨[ξ1i w1i 2]¨1 + · · · + ∑ ¨[ξNi wNi 2]¨1 (4.8) ¨[κ1e v1e ]¨ + · · · + ∑1 + ∑ e∈Le
Resource Management Algorithm Design. Following the similar SDR approach as in the strategy 1, the problem of strategy 2 in (4.11) can be transformed as α ∑ ∑ ξnitr(WiDn) + ∑ κnetr(VeDn)! Wi, Ve, [real] n∈Lb i∈Li e∈Le ∑
i∈ Li ∑ e∈Le ∑ n∈Lb +β tr(W ) + tr(V )! + ζ nB[real],