72 search results - page 2 / 15 » Approximating Semidefinite Packing Programs |
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...
EM
2010
13 years 5 months ago
2010
Abstract. The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and...
CDC
2009
IEEE
13 years 9 months ago
2009
IEEE
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
FSTTCS
2001
Springer
13 years 9 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
SIAMJO
2002
13 years 5 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 ...