45 search results - page 1 / 9 » Solving polynomial least squares problems via semidefinite p... |
JGO
2010
12 years 11 months ago
2010
TCS
2008
13 years 4 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
ACML
2009
Springer
13 years 8 months ago
2009
Springer
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
We consider the robust beamforming problem under imperfect channel state information (CSI) subject to SINR constraints in a downlink multiuser MISO system. One popular approach to...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...