Koc University Digital Collections
metadata only
Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
The problem of minimizing a quadratic form over the unit simplex, referred to as a standard quadratic optimization problem, admits an exact reformulation as a linear optimization problem over the convex cone of completely positive matrices. This computationally intractable cone can be approximated i
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
- Nonlinear Rayleigh quotient optimization#998038
- Bounding the Multiplicities of Eigenvalues of Graph Matrices in Terms of Circuit Rank#256591
- Exact Quadratic Penalty Function for Symplectic Eigenvalue Problem#793640
- Exact Quadratic Penalty Function for Symplectic Eigenvalue Problem#789636
- Quadratic Word Equations with a Linear Side: Polynomial Nielsen Graph Diameter and NP-Completeness#1049993
Record · ID 955121
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