  We show that the Christensen-Sinclair factorization theorem, when the
underlying Hilbert spaces are finite dimensional, is an instance of strong
duality of semidefinite programming. This gives an elementary proof of the
result and also provides an efficient algorithm to compute the
Christensen-Sinclair factorization.
