arXiv (All)
open access
Affine Facial Reduction for Semidefinite Relaxations of Binary and Mixed-Binary Optimization Problems
Semidefinite programming (SDP) relaxations can provide strong bounds for binary and mixed-binary optimization problems, but their practical use is often limited by matrix variables of large order and by failures of Slater's condition, which can contribute to numerical difficulties for interior-point
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
- Affine Facial Reduction for Semidefinite Relaxations of Binary and Mixed-Binary Optimization Problems#920785
- On the Semidefinite Representability of Continuous Quadratic Submodular Minimization With Applications to Pricing and Moment Problems#798590
- On the Semidefinite Representability of Continuous Quadratic Submodular Minimization With Applications to Pricing and Moment Problems#797177
- The largest step path following algorithm for monotone linear complementarity problems#429976
- Unrolling Iterative Lanczos Algorithm for Ideal Low-pass Graph Filter Approximation#1077015
Record · ID 925019
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