2013
DOI: 10.1007/978-3-319-00200-2_7
View full text
|
|
Share

Abstract: AbstractWe consider the decision problem asking whether a partial rational symmetric matrix with an all-ones diagonal can be completed to a full positive semidefinite matrix of rank at most k. We show that this problem is N P -hard for any fixed integer k ≥ 2. Equivalently, for k ≥ 2, it is N P -hard to test membership in the rank constrained elliptope E k (G), i.e., the set of all partial matrices with off-diagonal entries specified at the edges of G, that can be completed to a positive semidefinite matrix o…

Expand abstract