28 search results - page 1 / 6 » The Positive Semidefinite Grothendieck Problem with Rank Con... |
ICALP
2010
Springer
13 years 9 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 ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
MOR
2008
13 years 4 months ago
2008
We consider the problem of finding a low
SIAMJO
2010
12 years 11 months ago
2010
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...