Simpler semi definite programs for completely bounded norms
The completely bounded trace and spectral
norms, for finite-dimensional spaces, are known to be efficiently expressible
by semi definite programs (J. Walrus, Theory of Computing 5: 11, 2009). This
paper presents two new, and arguably simpler, semidefinite programming
formulations of these norms.
The article: PDF (242 KB)
Source material: ZIP (80 KB)
BibTeX entry for this article (245 bytes)
No comments:
Post a Comment