Compartir
Chordal Graphs and Semidefinite Optimization (en Inglés)
Lieven Vandenberghe
(Autor)
·
Martin S. Andersen
(Autor)
·
Now Publishers
· Tapa Blanda
Chordal Graphs and Semidefinite Optimization (en Inglés) - Vandenberghe, Lieven ; Andersen, Martin S.
$ 105.510
$ 211.010
Ahorras: $ 105.500
Elige la lista en la que quieres agregar tu producto o crea una nueva lista
✓ Producto agregado correctamente a la lista de deseos.
Ir a Mis Listas
Origen: Estados Unidos
(Costos de importación incluídos en el precio)
Se enviará desde nuestra bodega entre el
Jueves 11 de Julio y el
Jueves 18 de Julio.
Lo recibirás en cualquier lugar de Chile entre 1 y 3 días hábiles luego del envío.
Reseña del libro "Chordal Graphs and Semidefinite Optimization (en Inglés)"
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)
Todos los libros de nuestro catálogo son Originales.
El libro está escrito en Inglés.
La encuadernación de esta edición es Tapa Blanda.
✓ Producto agregado correctamente al carro, Ir a Pagar.