213 search results - page 20 / 43 » Semidefinite programming |
IPCO
2008
13 years 10 months ago
2008
We consider the positive semidefinite (psd) matrices with binary entries. We give a characterisation of such matrices, along with a graphical representation. We then move on to co...
SIAMJO
2000
13 years 8 months ago
2000
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...
COCO
2008
Springer
13 years 10 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
SIAMMAX
2010
13 years 3 months ago
2010
The main goal of this paper is to develop a numerical procedure for construction of covariance matrices such that for a given covariance structural model and a discrepancy function...
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...