arXiv (All)
open access
Convergence rate of the moment-SOS hierarchy for univariate polynomial optimization
We study the convergence rate of the moment-SOS (sum-of-squares) hierarchy for polynomial optimization problems (POPs) on a bounded subset of the real line described by arbitrary polynomial inequalities. We prove that, for every fixed univariate POP, the relaxation error is bounded by $O(1/r^2)$, wh
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
- Minimum central circles: an effective characterization of the global asymptotic constant#1071400
- Unified Common-Root and Interpolation Bounds Based on Leading Monomial Data#1052072
- Sample Average Approximation for Distributionally Robust Optimization with $ϕ$-divergences#924540
- Sample Average Approximation for Distributionally Robust Optimization with $ϕ$-divergences#920309
- Computational Complexity of the Weisfeiler-Leman Dimension / Moritz Lichter, Simon Raßmann, Pascal Schweitzer#628988
Record · ID 1034358
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