Dipòsit Digital de Documents de la UAB
metadata only
An exact duality theory for semidefinite programming and its complexity implications
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
- Sparse Cuts for the Positive Semidefinite Cone#793594
- Sparse Cuts for the Positive Semidefinite Cone#789590
- Separating plane algorithms for convex optimization#429981
- Semidefinite relaxations for nonlinear elasticity with energies convex in the Cauchy-Green strain tensor#1035466
- A Bounded Degree SOS Plus SONC Hierarchy for Polynomial Optimization#1061859
Record · ID 445455
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