On copositive matrices with -1, 9, 1 entries

From MaRDI portal
Publication:2264831

DOI10.1016/0097-3165(73)90006-XzbMath0273.15019MaRDI QIDQ2264831

Yanyan Li

Publication date: 1973

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)




Related Items

SPN completable graphs, Criteria for copositive matrices, Cutting planes for semidefinite relaxations based on triangle-free subgraphs, Criteria for copositive matrices using simplices and barycentric coordinates, SPN graphs: when copositive = SPN, Triangle-free graphs and completely positive matrices, Generating irreducible copositive matrices using the stable set problem, On the DJL conjecture for order 6, A new certificate for copositivity, Minimal zeros of copositive matrices, Performance comparison of two recently proposed copositivity tests, Separation and relaxation for cones of quadratic forms, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, The inverse of a symmetric nonnegative matrix can be copositive, Sufficient conditions to be exceptional, An algorithm for determining copositive matrices, Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision, The extreme rays of the \(5 \times 5\) copositive cone, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, Copositivity and sparsity relations using spectral properties, Geometry of the copositive and completely positive cones, Spectral theory of copositive matrices, The extreme rays of the \(6\times 6\) copositive cone, Extremal copositive matrices with minimal zero supports of cardinality two, A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors, Copositivity tests based on the linear complementarity problem, Unnamed Item, On copositive matrices, The copositive completion problem



Cites Work