Papers › Chebyshev centers and radii for sets induced by quadratic matrix inequalities
Chebyshev centers and radii for sets induced by quadratic matrix inequalities
Amir Shakouri, Henk J. van Waarde, M. Kanat Camlibel
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper studies sets of matrices induced by quadratic inequalities. In particular, the center and radius of a smallest ball containing the set, called a Chebyshev center and the Chebyshev radius, are studied. In addition, this work studies the diameter of the set, which is the farthest distance between any two elements of the set. Closed-form solutions are provided for a Chebyshev center, the Chebyshev radius, and the diameter of sets induced by quadratic matrix inequalities (QMIs) with respect to arbitrary unitarily invariant norms. Examples of these norms include the Frobenius norm, spectral norm, nuclear norm, Schatten p-norms, and Ky Fan k-norms. In addition, closed-form solutions are presented for the radius of the largest ball within a QMI-induced set. Finally, the paper discusses applications of the presented results in data-driven modeling and control.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections