Work

A semidefinite programming characterization of the Crawford number

Year: 2024

Type: preprint

Abstract: 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 |$.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2403.08617

Authors: Friedland, Shmuel, Vinzant, Cynthia

Language: English

Topic: Advanced Optimization Algorithms Research

Subfield: Numerical Analysis

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

Funder: National Science Foundation

Award: CAREER: Determinantal, hyperbolic, and log-concave polynomials in theory and applications

OpenAlex ID: W4392828260

Cites:

Cited by:

Related to: 10