Chordal Graphs and Semidefinite Optimization

Lieven Vandenberghe, Martin Skovgaard Andersen

Research output: Contribution to journalJournal articleResearchpeer-review


Chordal graphs play a central role in techniques for exploiting sparsity in large semidefinite optimization problems and in related con-vex optimization problems involving sparse positive semidefinite matrices. Chordal graph properties are also fundamental to several classical results in combinatorial optimization, linear algebra, statistics, signal processing, machine learning, and nonlinear optimization. This survey covers the theory and applications of chordal graphs, with an emphasis on algorithms developed in the literature on sparse Cholesky factorization. These algorithms are formulated as recursions on elimination trees, supernodal elimination trees, or clique trees associated with the graph. The best known example is the multifrontal Cholesky factorization algorithm, but similar algorithms can be formulated for a variety of related problems, including the computation of the partial inverse of a sparse positive definite matrix, positive semidefinite and Euclidean distance matrix completion problems, and the evaluation of gradients and Hessians of logarithmic barriers for cones of sparse positive semidefinite matrices and their dual cones. The purpose of the survey is to show how these techniques can be applied in algorithms for sparse semidefinite optimization, and to point out the connections with related topics outside semidefinite optimization, such as probabilistic networks, matrix completion problems, and partial separability in nonlinear optimization.
Original languageEnglish
JournalFoundations and Trends in Optimization
Issue number4
Pages (from-to)241-433
Publication statusPublished - 2015


Dive into the research topics of 'Chordal Graphs and Semidefinite Optimization'. Together they form a unique fingerprint.

Cite this