A semidefinite programming characterization of the Crawford number
<|reference_start|>A semidefinite programming characterization of the Crawford number: We give a semidefinite programming characterization of the Crawford number. We show that the computation of the Crawford number within $\varepsilon$ precision is computable in polynomial time in the data and $|\log \varepsilon |$.<|reference_end|>
@article{friedland2024a,
    title={A semidefinite programming characterization of the Crawford number},
    author={Shmuel Friedland and Cynthia Vinzant},
    journal={arXiv preprint arXiv:2403.08617},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.08617},
    primaryClass={math.NA cs.NA}
}