90 search results - page 6 / 18 » On approximating complex quadratic optimization problems via... |
CORR
2008
Springer
13 years 8 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...
SIAMJO
2011
13 years 2 months ago
2011
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
GLOBECOM
2009
IEEE
13 years 5 months ago
2009
IEEE
The received signal strength (RSS)-based approach to wireless localization offers the advantage of low cost and easy implementability. To circumvent the nonconvexity of the convent...
CVPR
2006
IEEE
14 years 10 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...