Shmuel Friedland, On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices, Vol. 2025 (2025), Article ID 14, pp. 1-20

Full Text: PDF
DOI: 10.23952/cot.2025.14

Received November 3, 2023; Accepted February 18, 2024; Published online December 26, 2024

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 $\varepsilon$ precision are polynomially time computable in the data and $|\log \varepsilon |$ using the short step, primal interior point method.

How to Cite this Article:
S. Friedland, On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices, Commun. Optim. Theory 2025 (2025) 14.