337 search results - page 2 / 68 » Semidefinite Programming Based Approximation Algorithms |
SWAT
2010
Springer
13 years 2 months ago
2010
Springer
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
ISAAC
1998
Springer
13 years 9 months ago
1998
Springer
NIPS
2004
13 years 6 months ago
2004
We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its...
SIAMJO
2011
12 years 11 months ago
2011
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...