Share
Chordal Graphs and Semidefinite Optimization (in English)
Lieven Vandenberghe
(Author)
·
Martin S. Andersen
(Author)
·
Now Publishers
· Paperback
Chordal Graphs and Semidefinite Optimization (in English) - Vandenberghe, Lieven ; Andersen, Martin S.
$ 83.37
$ 99.00
You save: $ 15.63
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My WishlistsIt will be shipped from our warehouse between
Tuesday, June 25 and
Wednesday, June 26.
You will receive it anywhere in United States between 1 and 3 business days after shipment.
Synopsis "Chordal Graphs and Semidefinite Optimization (in English)"
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. Chordal Graphs and Semidefinite Optimization 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.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.
✓ Producto agregado correctamente al carro, Ir a Pagar.
