arXiv (All)
open access
The Geometry of Optimal Max-Cut SDP Solutions
When the semidefinite relaxation of Max-Cut is exact, its optimal cut sign vectors lie in the kernel of the optimal dual slack. We study when they span this kernel and which matrices can occur as certificates with this property. Our main result realizes every doubly nonnegative matrix with positive
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
- SOME EXTREMAL PROBLEMS UNDER GROWTH/EXPANSION CONSTRAINTS#334546
- An inexact variable metric proximal linearization method for composite optimization on manifolds#1156203
- Pointwise boundary observation in geometric optimization problems associated to variational inequalities#630405
- An almost quadratic bound for the minimal excluded minors for a surface#927276
- Primal Methods for Constrained Variational Inequalities: Optimal Rates, Feasibility Trade-offs, and Lower Bounds#1117693
Record · ID 1132028
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