In this talk I will explain how the completely bounded trace and spectral norms, for finite dimensional mappings, can be efficiently expressed in terms of semidefinite programs. This provides an efficient method by which these norms may be both calculated and verified, and gives alternate proofs of some known facts about them.

Paper reference: arXiv:0901.4709