arXiv (All)
open access
On the $Ω(n)$ SDP relaxation gap for Submodular Box-Constrained Quadratic Programming
Continuous submodular optimization is an important class of nonconvex problems with global guarantees, for which the submodular box-constrained quadratic programming (BCQP) forms a fundamental subclass. It arises naturally as quadratic subproblems of general twice-differentiable submodular problems
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
- Duality Gaps in Partially Nonconvex Optimization#670324
- Duality Gaps in Partially Nonconvex Optimization#668259
- Economy of scale in algorithm design : approximation algorithms for submodular optimization and network design#195727
- Tightness of and counterexamples to several quantum estimates#1049940
- Optimal gradient estimates for the insulated conductivity problem with dimensions more than two#155444
Record · ID 974624
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