The copositive completion problem: unspecified diagonal entries

DOI10.1016/J.LAA.2006.06.022MaRDI QIDQ865456zbMATH OpenOpenAlexFDO

Authors Leslie Hogben

Publication date 14 February 2007

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

Full work available at URL https://lib.dr.iastate.edu/math_pubs/82

zbMATH Keywords

copositive matrixmatrix completionpartial matrixstrictly copositive matrix

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48)

Review text

\textit{L. Hogben}, \textit{C. R. Johnson} and \textit{R. Reams} [Linear Algebra Appl. 408, 207--211 (2005; Zbl 1098.15010)], showed that any partial (strictly) copositive matrix all of whose diagonal entries are specified can be completed to a (strictly) copositive matrix. In this short note the first author considers partial (strictly) copositive matrices with unspecified diagonal entries.

Recommendations

• The copositive completion problem
• The CP-matrix completion problem
• The totally positive completion problem
• Schur products and matrix completions
• scientific article; zbMATH DE number 1413869

Cites work

• The copositive completion problem

Cited in

(3)

• The copositive completion problem
• SPN completable graphs
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization

This page was built for publication: The copositive completion problem: unspecified diagonal entries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q865456)