On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices
Abstract
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 precision are polynomially time computable in the data and | | using the short step, primal interior point method.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.