- ホーム
- > 洋書
- > 英文書
- > Science / Mathematics
Full Description
Chordal graphs play a central role in techniques for exploiting sparsity in large semidefinite optimization problems, and in related convex 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 book 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, such as 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.
This monograph shows how these techniques can be applied in algorithms for sparse semidefinite optimization. It also points out the connections with related topics outside semidefinite optimization, such as probabilistic networks, matrix completion problems, and partial separability in nonlinear optimization.
Contents
1: Introduction 2: Graphs 3: Chordal Graphs 4: Perfect Elimination Ordering 5: Combinatorial Optimization 6: Graph Elimination 7: Discrete Applications of Graph Elimination. 8: Sparse Matrices 9: Positive Semidefinite Matrices 10: Positive Semidefinite Matrix Completion 11: Correlation and Euclidean Distance Matrices 12: Partial Separability in Convex Optimization 13: Conic Optimization 14: Sparse Semidefinite Optimization. Ackowledgments. Notation. References
