The difference between \(5\times 5\) doubly nonnegative and completely positive matrices

DOI10.1016/j.laa.2009.05.021zbMath1175.15026OpenAlexW2025986033MaRDI QIDQ840651

Kurt M. Anstreicher, Samuel Burer, Mirjam Dür

Publication date: 14 September 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2009.05.021

zbMATH Keywords

convex conecopositive matrixcompletely positive matrixdoubly nonnegative matrixexceptional matrix

Mathematics Subject Classification ID

Positive matrices and their generalizations; cones of matrices (15B48) Canonical forms, reductions, classification (15A21)

Related Items

Cutting planes for semidefinite relaxations based on triangle-free subgraphs, Irreducible elements of the copositive cone, On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets, Sparse solutions to random standard quadratic optimization problems, Separating doubly nonnegative and completely positive matrices, Separation and relaxation for cones of quadratic forms, Copositive optimization -- recent developments and applications, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, Factorization and cutting planes for completely positive matrices by copositive projection, The extreme rays of the \(5 \times 5\) copositive cone, Computing symmetric nonnegative rank factorizations, \(\{0,1\}\) completely positive tensors and multi-hypergraphs, Unnamed Item, Optimization over structured subsets of positive semidefinite matrices via column generation, A note on ``\(5\times 5\) completely positive matrices, The CP-Matrix Approximation Problem, Building a completely positive factorization, On \(\{0,1\}\) CP tensors and CP pseudographs, Copositive Programming, An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs, Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations

Cites Work

• Unnamed Item
• Unnamed Item
• \(5 \times 5\) completely positive matrices
• A note on the computation of the CP-rank
• New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
• Extreme vectors of doubly nonnegative matrices
• Completely positive matrices.
• CP rank of completely positive matrices of order 5
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Approximation of the Stability Number of a Graph via Copositive Programming
• Constructing copositive matrices from interior matrices
• On the Matrix Equation X′X = A
• Completely positive matrices of order five