arXiv (All)
open access
A hierarchy of eigencomputations for polynomial optimization on the sphere
We introduce a convergent hierarchy of lower bounds on the minimum value of a real form over the unit sphere. The main practical advantage of our hierarchy over the real sum-of-squares (RSOS) hierarchy is that the lower bound at each level of our hierarchy is obtained by a minimum eigenvalue computa
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Polynomial-Time Inner Approximation Algorithm for Multi-Objective and Parametric Optimization#179151
- Approximate Polynomial Satisfiability is in the Counting Hierarchy#1155579
- Bounded Integer Quadratic Programming through Parallelepiped Covers and Discrete Convic Optimization#1011604
- Lanczos with compression for symmetric eigenvalue problems#635753
- Lanczos with compression for symmetric eigenvalue problems#633404
Record · ID 1000446
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive