Paper Info
Title
Polynomial-time DC (POTDC) for sum-rate maximization in two-way AF MIMO relaying.
Abstract
The problem of sum-rate maximization in two-way amplify-and- forward (AF) multiple-input multiple-output (MIMO) relaying is considered. Mathematically, this problem is equivalent to the constrained maximization of the product of quadratic ratios that is a non-convex problem. Such problems appear also in many other applications. This problem can be further relaxed into a difference-of-convex functions (DC) programming problem, which is typically solved using the branch-and-bound method without polynomial-time complexity guarantees. We, however, develop a polynomial-time convex optimization-based algorithm for solving the corresponding DC programming problem named polynomial-time DC (POTDC). POTDC is based on a specific parameterization of the problem, semi-definite programming (SDP) relaxation, linearization, and iterations over a single parameter. The complexity of the problem solved at each iteration of the algorithm is equivalent to that of the SDP problem. The effectiveness of the proposed POTDC method for the sum-rate maximization in two-way AF MIMO relay systems is shown.
Year
DOI
Venue
2012
10.1109/ICASSP.2012.6288520
ICASSP
Keywords
Field
DocType
MIMO communication,amplify and forward communication,communication complexity,concave programming,convex programming,iterative methods,linearisation techniques,relaxation theory,relays,tree searching,DC programming problem,POTDC,SDP relaxation,branch-and-bound method,constrained maximization,difference-of-convex functions programming,iterations,linearization,nonconvex problem,parameterization,polynomial-time DC,polynomial-time complexity guarantees,polynomial-time convex optimization-based algorithm,quadratic ratios,semidefinite programming relaxation,sum-rate maximization,two-way AF MIMO relaying,two-way amplify-and-forward multiple-input multiple-output relaying,Two-way relaying,difference-of-convex functions,semi-definite relaxation,sum-rate
Mathematical optimization,Iterative method,Computer science,Entropy maximization,MIMO,Communication complexity,Time complexity,Convex optimization,Maximization,Linearization
Conference
ISSN
Citations 
PageRank 
1520-6149
4
0.43
References 
Authors
10
4
Name
Order
Citations
PageRank
Arash Khabbazibasmenj118611.70
sergiy a vorobyov21563113.46
Florian Roemer341038.82
Martin Haardt43531311.32