Lastly, it is often important to exploit sparsity in large semidefinite optimization problem and chordal graph properties from graph and sparse matrix theory plays a central role. The following proposition is the primary result that exploit the chordal sparsity and decompose a larger semidefinite constraint as a set of smaller semidefinite constraints. Details could be found in the survey of chordal graphs and semidefinite optimization [1]}.
