A semidefinite programming characterization of the Crawford number

Shmuel Friedland; Cynthia Vinzant

paper

A semidefinite programming characterization of the Crawford number

arXiv:2403.08617

Abstract

We give a semidefinite programming characterization of the Crawford number. We show that the computation of the Crawford number within $ε$ precision is computable in polynomial time in the data and $∣ lo g ε ∣$ .

7 pages, revised version, to appear in Pure and Applied Functional Analysis, ISSN 2189-3756 (PRINT) ISSN 2189-3764 (ONLINE)