SPN graphs: when copositive = SPN

DOI10.1016/j.laa.2016.07.018zbMath1345.05111arXiv1604.02172OpenAlexW2335862003MaRDI QIDQ314749

Naomi Shaked-Monderer

Publication date: 16 September 2016

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

Full work available at URL: https://arxiv.org/abs/1604.02172

zbMATH Keywords

copositive matricesSPN matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Positive matrices and their generalizations; cones of matrices (15B48) Graph theory (05C99) Sign pattern matrices (15B35)

Related Items

On standard quadratic programs with exact and inexact doubly nonnegative relaxations ⋮ Corrigendum to: ``SPN graphs: when copositive = SPN ⋮ Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 ⋮ Hypergraph characterizations of copositive tensors ⋮ Unnamed Item ⋮ On the generalized inverse of a copositive matrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• SPN completable graphs
• Copositive optimization -- recent developments and applications
• Criteria for copositive matrices of order four
• A test for copositive matrices
• The Schur complement and its applications
• On copositive matrices with -1, 9, 1 entries
• Extreme copositive quadratic forms
• Irreducible elements of the copositive cone
• Remarks on the recursive structure of copositivity
• Some NP-complete problems in quadratic and nonlinear programming
• Linear-Time Copositivity Detection for Tridiagonal Matrices and Extension to Block-Tridiagonality