90 search results - page 7 / 18 » On approximating complex quadratic optimization problems via... |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
This paper considers the problem of low complexity implementation of high-performance semidefinite relaxation (SDR) MIMO detection methods. Currently, most SDR MIMO detectors are...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
TSP
2008
13 years 7 months ago
2008
This paper deals with the design of coded waveforms which optimize radar performances in the presence of colored Gaussian disturbance. We focus on the class of linearly coded puls...