177 search results - page 3 / 36 » Semidefinite Programming Relaxations for the Quadratic Assig... |
ICASSP
2008
IEEE
14 years 1 months ago
2008
IEEE
We develop a computationally efficient and memory efficient approach to (near) maximum a posteriori probability demodulation for MIMO systems with QPSK signalling, based on semi...
SIAMJO
2000
13 years 6 months ago
2000
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...
EOR
2010
13 years 7 months ago
2010
We propose a modified alternate direction method for solving convex quadratically constrained quadratic semidefinite optimization problems. The method is a first-order method, the...
TSP
2010
13 years 1 months 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...
SIAMJO
2002
13 years 6 months ago
2002
We consider a conic-quadratic (and in particular a quadratically constrained) optimization problem with uncertain data, known only to reside in some uncertainty set U. The robust ...