CP graphs and SPN graphs
From MaRDI portal
Cites work
- Bipartite completely positive matrices
- Characterization of completely positive graphs
- Combinatorial results on completely positive matrices
- Complete positivity
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Copositive and completely positive matrices
- Corrigendum to: ``SPN graphs: when copositive = SPN
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs
- scientific article; zbMATH DE number 3176168 (Why is no real title available?)
- scientific article; zbMATH DE number 510852 (Why is no real title available?)
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- scientific article; zbMATH DE number 850230 (Why is no real title available?)
- Irreducible elements of the copositive cone
- Line perfect graphs
- Minimal zeros of copositive matrices
- Nonnegative factorization of positive semidefinite nonnegative matrices
- On copositive matrices with -1, 9, 1 entries
- On copositive programming and standard quadratic optimization problems
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations
- On the computational complexity of membership problems for the completely positive cone and its dual
- On the DJL conjecture for order 6
- On the Matrix Equation X′X = A
- Some NP-complete problems in quadratic and nonlinear programming
- SPN graphs
- SPN graphs: when copositive = SPN
- The extreme rays of the \(5 \times 5\) copositive cone
- The triangle graph T₆ is not SPN
This page was built for publication: CP graphs and SPN graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7008029)
