A semidefinite programming characterization of the Crawford number
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917306439827456 |
|---|---|
| author | Friedland, Shmuel Vinzant, Cynthia |
| author_facet | Friedland, Shmuel Vinzant, Cynthia |
| contents | 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 |$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_08617 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A semidefinite programming characterization of the Crawford number Friedland, Shmuel Vinzant, Cynthia Numerical Analysis 15A60, 15A69, 68Q25, 68W25, 90C22, 90C51 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 |$. |
| title | A semidefinite programming characterization of the Crawford number |
| topic | Numerical Analysis 15A60, 15A69, 68Q25, 68W25, 90C22, 90C51 |
| url | https://arxiv.org/abs/2403.08617 |