28 search results - page 2 / 6 » The Positive Semidefinite Grothendieck Problem with Rank Con... |
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
In this paper, we develop a new approach to the robust beamforming for general-rank signal models. Our method is based on the worst-case performance optimization using a semi-de n...
SIAMJO
2010
13 years 11 days ago
2010
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
ICASSP
2008
IEEE
14 years 2 days ago
2008
IEEE
In this paper, we develop an improved approach to the worstcase robust adaptive beamforming for general-rank signal models by means of taking into account the positive semi-defin...
SIAMMAX
2010
13 years 11 days ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
TSP
2010
13 years 9 days ago
2010
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...