A Caltech Library Service

Convex-concave procedure for weighted sum-rate maximization in a MIMO interference network

You, Seungil and Chen, Lijun and Liu, Youjian (Eugene) (2014) Convex-concave procedure for weighted sum-rate maximization in a MIMO interference network. In: 2014 IEEE Global Communications Conference. IEEE , Piscataway, NJ, pp. 4060-4065. ISBN 978-1-4799-3512-3.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


The weighted sum-rate maximization in a general multiple-input multiple-output (MIMO) interference network has known to be a challenging non-convex problem, mainly due to the interference between different links. In this paper, by exploring the special structure of the sum-rate function being a difference of concave functions, we apply the convex-concave procedure to the weighted sum-rate maximization to handle non-convexity. With the introduction of a certain damping term, we establish the monotonie convergence of the proposed algorithm. Numerical examples show that the introduced damping term slows down the convergence of our algorithm but helps with finding a better solution in the network with high interference. Even though our algorithm has a slower convergence than some existing ones, it has the guaranteed convergence and can handle more general constraints and thus provides a general solver that can find broader applications.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© 2014 IEEE.
Subject Keywords:Convex-concave procedure, weighted sum-rate maximization, interference networks, multiple-input multiple-output (MIMO)
Record Number:CaltechAUTHORS:20170124-174544600
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:73685
Deposited By: Kristin Buxton
Deposited On:26 Jan 2017 00:37
Last Modified:11 Nov 2021 05:20

Repository Staff Only: item control page