90 search results - page 4 / 18 » On approximating complex quadratic optimization problems via... |
119
Voted
TSP
2010
14 years 7 months ago
2010
Abstract--In this paper, we deal with the problem of constrained code optimization for radar space-time adaptive processing (STAP) in the presence of colored Gaussian disturbance. ...
121
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Recent years have seen an explosion of interest in lift and project methods, such as those proposed by Lov
141
Voted
IPCO
2008
15 years 2 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
133
Voted
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
99
Voted
TSP
2010
14 years 7 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...