SPN completable graphs

DOI10.1016/j.laa.2014.10.021zbMath1334.15069OpenAlexW2068974785MaRDI QIDQ269250

Mirjam Dür, Abraham Berman, Naomi Shaked-Monderer, M. Rajesh Kannan

Publication date: 18 April 2016

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

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

zbMATH Keywords

completely positive matricesdoubly nonnegative matricescompletion problemscopositive matricesCP graphsSPN matrices

Mathematics Subject Classification ID

Positive matrices and their generalizations; cones of matrices (15B48) Matrix completion problems (15A83)

Related Items

On standard quadratic programs with exact and inexact doubly nonnegative relaxations, SPN graphs: when copositive = SPN, A new certificate for copositivity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of completely positive graphs
• Positive definite completions of partial Hermitian matrices
• The copositive completion problem: unspecified diagonal entries
• Combinatorial results on completely positive matrices
• Complete positivity
• Nonnegative factorization of positive semidefinite nonnegative matrices
• Extensions of band matrices with band inverses
• On copositive matrices with -1, 9, 1 entries
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Two remarks on copositive matrices
• The copositive completion problem
• Irreducible elements of the copositive cone
• On the Matrix Equation X′X = A
• The completely positive and doubly nonnegative completion problems