  We give a semidefinite programming characterizations of the numerical radius
and its dual norm for quaternionic matrices. We show that the computation of
the numerical radius and its dual norm within $\varepsilon$ precision are
polynomially time computable in the data and $|\log \varepsilon |$ using the
short step, primal interior point method.
