80,055 research outputs found
Sum-Rate Maximization in Two-Way AF MIMO Relaying: Polynomial Time Solutions to a Class of DC Programming Problems
Sum-rate maximization in two-way amplify-and-forward (AF) multiple-input
multiple-output (MIMO) relaying belongs to the class of difference-of-convex
functions (DC) programming problems. DC programming problems occur as well in
other signal processing applications and are typically solved using different
modifications of the branch-and-bound method. This method, however, does not
have any polynomial time complexity guarantees. In this paper, we show that a
class of DC programming problems, to which the sum-rate maximization in two-way
MIMO relaying belongs, can be solved very efficiently in polynomial time, and
develop two algorithms. The objective function of the problem is represented as
a product of quadratic ratios and parameterized so that its convex part (versus
the concave part) contains only one (or two) optimization variables. One of the
algorithms is called POlynomial-Time DC (POTDC) and is based on semi-definite
programming (SDP) relaxation, linearization, and an iterative search over a
single parameter. The other algorithm is called RAte-maximization via
Generalized EigenvectorS (RAGES) and is based on the generalized eigenvectors
method and an iterative search over two (or one, in its approximate version)
optimization variables. We also derive an upper-bound for the optimal values of
the corresponding optimization problem and show by simulations that this
upper-bound can be achieved by both algorithms. The proposed methods for
maximizing the sum-rate in the two-way AF MIMO relaying system are shown to be
superior to other state-of-the-art algorithms.Comment: 35 pages, 10 figures, Submitted to the IEEE Trans. Signal Processing
in Nov. 201
Iterative learning control for constrained linear systems
This paper considers iterative learning control for linear systems with convex control input constraints. First, the constrained ILC problem is formulated in a novel successive projection framework. Then, based on this projection method, two algorithms are proposed to solve this constrained ILC problem. The results show that, when perfect tracking is possible, both algorithms
can achieve perfect tracking. The two algorithms differ however in that one algorithm needs much less computation than the other. When perfect tracking is not possible, both algorithms can exhibit a form of practical convergence to a "best approximation". The effect of weighting matrices on the performance of the algorithms is also discussed and finally, numerical simulations are given to demonstrate the e®ectiveness of the proposed methods
Linear Transceiver design for Downlink Multiuser MIMO Systems: Downlink-Interference Duality Approach
This paper considers linear transceiver design for downlink multiuser
multiple-input multiple-output (MIMO) systems. We examine different transceiver
design problems. We focus on two groups of design problems. The first group is
the weighted sum mean-square-error (WSMSE) (i.e., symbol-wise or user-wise
WSMSE) minimization problems and the second group is the minimization of the
maximum weighted mean-squareerror (WMSE) (symbol-wise or user-wise WMSE)
problems. The problems are examined for the practically relevant scenario where
the power constraint is a combination of per base station (BS) antenna and per
symbol (user), and the noise vector of each mobile station is a zero-mean
circularly symmetric complex Gaussian random variable with arbitrary covariance
matrix. For each of these problems, we propose a novel downlink-interference
duality based iterative solution. Each of these problems is solved as follows.
First, we establish a new mean-square-error (MSE) downlink-interference
duality. Second, we formulate the power allocation part of the problem in the
downlink channel as a Geometric Program (GP). Third, using the duality result
and the solution of GP, we utilize alternating optimization technique to solve
the original downlink problem. For the first group of problems, we have
established symbol-wise and user-wise WSMSE downlink-interference duality.Comment: IEEE TSP Journa
Robust Sum MSE Optimization for Downlink Multiuser MIMO Systems with Arbitrary Power Constraint: Generalized Duality Approach
This paper considers linear minimum meansquare- error (MMSE) transceiver
design problems for downlink multiuser multiple-input multiple-output (MIMO)
systems where imperfect channel state information is available at the base
station (BS) and mobile stations (MSs). We examine robust sum mean-square-error
(MSE) minimization problems. The problems are examined for the generalized
scenario where the power constraint is per BS, per BS antenna, per user or per
symbol, and the noise vector of each MS is a zero-mean circularly symmetric
complex Gaussian random variable with arbitrary covariance matrix. For each of
these problems, we propose a novel duality based iterative solution. Each of
these problems is solved as follows. First, we establish a novel sum average
meansquare- error (AMSE) duality. Second, we formulate the power allocation
part of the problem in the downlink channel as a Geometric Program (GP). Third,
using the duality result and the solution of GP, we utilize alternating
optimization technique to solve the original downlink problem. To solve robust
sum MSE minimization constrained with per BS antenna and per BS power problems,
we have established novel downlink-uplink duality. On the other hand, to solve
robust sum MSE minimization constrained with per user and per symbol power
problems, we have established novel downlink-interference duality. For the
total BS power constrained robust sum MSE minimization problem, the current
duality is established by modifying the constraint function of the dual uplink
channel problem. And, for the robust sum MSE minimization with per BS antenna
and per user (symbol) power constraint problems, our duality are established by
formulating the noise covariance matrices of the uplink and interference
channels as fixed point functions, respectively.Comment: IEEE TSP Journa
Robust Adaptive Beamforming for General-Rank Signal Model with Positive Semi-Definite Constraint via POTDC
The robust adaptive beamforming (RAB) problem for general-rank signal model
with an additional positive semi-definite constraint is considered. Using the
principle of the worst-case performance optimization, such RAB problem leads to
a difference-of-convex functions (DC) optimization problem. The existing
approaches for solving the resulted non-convex DC problem are based on
approximations and find only suboptimal solutions. Here we solve the non-convex
DC problem rigorously and give arguments suggesting that the solution is
globally optimal. Particularly, we rewrite the problem as the minimization of a
one-dimensional optimal value function whose corresponding optimization problem
is non-convex. Then, the optimal value function is replaced with another
equivalent one, for which the corresponding optimization problem is convex. The
new one-dimensional optimal value function is minimized iteratively via
polynomial time DC (POTDC) algorithm.We show that our solution satisfies the
Karush-Kuhn-Tucker (KKT) optimality conditions and there is a strong evidence
that such solution is also globally optimal. Towards this conclusion, we
conjecture that the new optimal value function is a convex function. The new
RAB method shows superior performance compared to the other state-of-the-art
general-rank RAB methods.Comment: 29 pages, 7 figures, 2 tables, Submitted to IEEE Trans. Signal
Processing on August 201
Design of First-Order Optimization Algorithms via Sum-of-Squares Programming
In this paper, we propose a framework based on sum-of-squares programming to
design iterative first-order optimization algorithms for smooth and strongly
convex problems. Our starting point is to develop a polynomial matrix
inequality as a sufficient condition for exponential convergence of the
algorithm. The entries of this matrix are polynomial functions of the unknown
parameters (exponential decay rate, stepsize, momentum coefficient, etc.). We
then formulate a polynomial optimization, in which the objective is to optimize
the exponential decay rate over the parameters of the algorithm. Finally, we
use sum-of-squares programming as a tractable relaxation of the proposed
polynomial optimization problem. We illustrate the utility of the proposed
framework by designing a first-order algorithm that shares the same structure
as Nesterov's accelerated gradient method
- …