90 search results - page 2 / 18 » On approximating complex quadratic optimization problems via... |
SIAMJO
2002
14 years 9 months ago
2002
We consider a conic-quadratic (and in particular a quadratically constrained) optimization problem with uncertain data, known only to reside in some uncertainty set U. The robust ...
103
click to vote
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...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract--In cognitive radio (CR) networks with multipleinput multiple-output (MIMO) links, secondary users (SUs) can exploit "spectrum holes" in the space domain to acce...
FCT
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
JMLR
2006
14 years 9 months ago
2006
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...