Complexity of the positive semidefinite matrix completion problem with a rank constraint.
We 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 NP-hard for any fixed integer k ≥ 2. Equivalently, for k ≥ 2, it is NP-hard to test membership in the rank constrained elliptope Ek(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 of rank at most k. Additionally, we show that deciding membership in the convex hull of Ek(G) is also NP-hard for any fixed integer k ≥ 2.
|Matrix completion, semidefinite programming, graph realization.|
|Logistics (theme 3)|
|Cornell University Library|
|arXiv.org e-Print archive|
|Semidefinite programming and combinatorial optimization , Spinoza prijs Lex Schrijver|
|Organisation||Networks and Optimization|
Eisenberg-Nagy, M, Laurent, M, & Varvitsiotis, A. (2012). Complexity of the positive semidefinite matrix completion problem with a rank constraint.. arXiv.org e-Print archive. Cornell University Library .