arXiv (All)
open access
A Bounded Degree SOS Plus SONC Hierarchy for Polynomial Optimization
We propose a bounded degree SOS+SONC hierarchy for constrained polynomial optimization, termed B-SOS+SONC. Starting from Lasserre's bounded-degree SOS framework, we enlarge the certificate cone from SOS to the recently introduced SOS+SONC cone, thereby combining the algebraic strength of semidefinit
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
- Sparse Cuts for the Positive Semidefinite Cone#793594
- Sparse Cuts for the Positive Semidefinite Cone#789590
- Fast Algorithms for Sparse PCA and Robust Sparse Estimation#996529
- An exact duality theory for semidefinite programming and its complexity implications#445455
- Arctic Auctions, Linear Fisher Markets, and Rational Convex Programs#665588
Record · ID 1061859
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