arXiv (All)
open access
Benign Degeneracy for First-Order Methods in Exact Boolean Moment-SOS Relaxations
Pseudo-Boolean optimization -- minimizing a polynomial over $\{\pm 1\}^n$ -- includes MAX-CUT, binary quadratic optimization, and Ising models. The moment-sum-of-squares (Moment-SOS) hierarchy provides certified semidefinite relaxations that are often empirically exact at low order. We ask: once a r
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
- Perturb-and-Solve: Efficient Learned-Operator Conditioning for Latent Diffusion Inverse Problems#1117883
- Recovery Guarantees for Posterior Sampling of One-Bit Compressed Sensing#1249114
- A restart-free accelerated algorithm for nonconvex minimization: continuous- and discrete-time analysis#1327437
- A Second-Moment Theory for Floating-Point Reduction Trees#386822
- Robust Model Order Selection via Dithered Differential Step-Down Thresholding#798491
Record · ID 1355199
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