213 search results - page 2 / 43 » Semidefinite programming |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The tendency of semidefinite programs to compose perfectly under product has been exploited many times in complexity theory: for example, by Lov
SIAMJO
2010
13 years 1 days ago
2010
We consider the problem of minimizing a polynomial on the hypercube [0, 1]n and derive new error bounds for the hierarchy of semidefinite programming approximations to this problem...
COR
2006
13 years 5 months ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
KDD
2003
ACM
14 years 5 months ago
2003
ACM
AUTOMATICA
2008
13 years 5 months ago
2008
In this paper we show how the symmetry present in many linear systems can be exploited to significantly reduce the computational effort required for controller synthesis. This app...