arXiv (All)
open access
Tight semidefinite programming relaxations for sparse box-constrained quadratic programs
We introduce a new class of semidefinite programming (SDP) relaxations for sparse box-constrained quadratic programs, obtained by a novel integration of the Reformulation Linearization Technique into standard SDP relaxations while explicitly exploiting the sparsity of the problem. The resulting rela
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
- Connections between semidefinite relaxations of the max-cut and stable set problems#458507
- Global weight optimization of frame structures under free-vibration eigenvalue constraints#1216121
- Algebraic Techniques and Semidefinite Optimization#67135
- A DC-Reformulation for Gradient-$L^0$-Constrained Problems#1142541
- Improved Algorithms for the Remote Point Problem#1061397
Record · ID 1342396
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