arXiv (All)
open access
Global Extendability of Flat Cliques in Sparse Moment Relaxations
Moment relaxations provide lower bounds for polynomial optimization problems, while the moment matrix carries more information than the bound itself. When the moment matrix satisfies the flat truncation condition, the bound is tight and global minimizers can be extracted from the matrix. In correlat
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 Local Central Limit Theorem for Clique Counts in Sparse Random Graphs#625427
- A Local Central Limit Theorem for Clique Counts in Sparse Random Graphs#623154
- Sharp perturbation bounds on the Frobenius norm of subunitary and positive polar factor#1141426
- The circular law for random band matrices with arbitrary doubly stochastic variance profiles#1327206
- Gaussian Approximation for Multivariate Martingale Sums from Uniformly Ergodic Markov Chains#987222
Record · ID 1342246
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