On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autore principale: Friedland, Shmuel
Natura: Preprint
Pubblicazione: 2023
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866917592632918016
author Friedland, Shmuel
author_facet Friedland, Shmuel
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2311_01629
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices
Friedland, Shmuel
Optimization and Control
15A60, 15A69, 15B33, 68Q25, 68W25, 90C22, 90C51
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.
title On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices
topic Optimization and Control
15A60, 15A69, 15B33, 68Q25, 68W25, 90C22, 90C51
url https://arxiv.org/abs/2311.01629