6 search results - page 1 / 2 » Semidefinite approximations for quadratic programs over orth... |
60
Voted
JGO
2010
14 years 4 months ago
2010
SIAMJO
2008
14 years 9 months ago
2008
It is known that the Karush-Kuhn-Tucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric ...
KDD
2007
ACM
15 years 10 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...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
TWC
2010
14 years 4 months ago
2010
Only one asymptotic training design for a special case of channel correlation was proposed in the literature for spatially correlated multiple-input multiple-output with orthogonal...