The copositive completion problem

An n × n real symmetric matrix A is called (strictly) copositive if xTAx ⩾ 0 (\u3e0) whenever x ∈ Rn satisfies x ⩾ 0 (x ⩾ 0 and x ≠ 0). The (strictly) copositive matrix completion problem asks which partial (strictly) copositive matrices have a completion to a (strictly) copositive matrix. We prove that every partial (strictly) copositive matrix has a (strictly) copositive matrix completion and give a lower bound on the values used in the completion. We answer affirmatively an open question whether an n × n copositive matrix A = (aij) with all diagonal entries aii = 1 stays copositive if each off-diagonal entry of A is replaced by min{aij, 1}