2000 character limit reached
On semidefinite programming characterizations of the numerical radius and its dual norm (2308.07287v3)
Published 14 Aug 2023 in math.NA, cs.NA, and math.OC
Abstract: We state and give self contained proofs of semidefinite programming characterizations of the numerical radius and its dual norm for 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 either the ellipsoid method or the short step, primal interior point method. We apply our results to give a simple formula for the spectral and nuclear norm of $2\times n\times m$ real tensor in terms of the numerical radius and its dual norm.