A polyhedral approximation algorithm for recession cones of spectrahedral shadows
Bibliographic record
Abstract
The intersection of an affine subspace with the cone of positive semidefinite matrices is called a spectrahedron.An orthogonal projection thereof is called a spectrahedral shadow or projected spectrahedron.Spectrahedra and their projections can be seen as a generalization of polyhedra.This article is concerned with the problem of approximating the recession cones of spectrahedra and spectrahedral shadows via polyhedral cones.We present two iterative algorithms to compute outer and inner approximations to within an arbitrary prescribed accuracy.The first algorithm is tailored to spectrahedra and is derived from polyhedral approximation algorithms for compact convex sets and relies on the fact, that an algebraic description of the recession cone is available.The second algorithm is designed for projected spectrahedra and does not require an algebraic description of the recession cone, which is in general more difficult to obtain.We prove correctness and finiteness of both algorithms and provide numerical examples.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".