@article {IOPORT.05505620,
    author       = {Qi, Houduo},
    title        = {Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming.},
    year         = {2009},
    journal      = {Linear Algebra and its Applications},
    volume       = {430},
    number       = {4},
    issn         = {0024-3795},
    pages        = {1151-1164},
    publisher    = {Elsevier Science Inc. (North-Holland), New York, NY},
    doi          = {10.1016/j.laa.2008.10.010},
    abstract     = {Summary: Let $G=(V,E)$ be a graph. In matrix completion theory, it is known that the following two conditions are equivalent: (i) $G$ is a chordal graph; (ii) Every $G$-partial positive semidefinite matrix has a positive semidefinite matrix completion. In this paper, we relate these two conditions to constraint nondegeneracy condition in semidefinite programming and prove that they are each equivalent to (iii) For any $G$-partial positive definite matrix that has a positive semidefinite completion, constraint nondegeneracy is satisfied at each of its positive semidefinite matrix completions.},
    identifier   = {05505620},
}