id: 05505620
dt: j
an: 05505620
au: Qi, Houduo
ti: Positive semidefinite matrix completions on chordal graphs and constraint
    nondegeneracy in semidefinite programming.
so: Linear Algebra Appl. 430, No. 4, 1151-1164 (2009).
py: 2009
pu: Elsevier Science Inc. (North-Holland), New York, NY
la: EN
cc: 
ut: chordal graph; constraint nondegeneracy; matrix completion; semidefinite
    programming
ci: 
li: doi:10.1016/j.laa.2008.10.010
ab: 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.
rv: