Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Spese di spedizione:
EUR 3,72
In U.S.A.
Descrizione libro Condizione: New. Codice articolo ABLIING23Mar2811580338066
Descrizione libro Soft Cover. Condizione: new. This item is printed on demand. Codice articolo 9781680830385
Descrizione libro PAP. Condizione: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L0-9781680830385
Descrizione libro Condizione: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Codice articolo ria9781680830385_lsuk
Descrizione libro PF. Condizione: New. Codice articolo 6666-IUK-9781680830385
Descrizione libro Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Codice articolo C9781680830385
Descrizione libro PAP. Condizione: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L0-9781680830385
Descrizione libro Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. KlappentextChordal 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 p. Codice articolo 464168002
Descrizione libro Condizione: New. Book is in NEW condition. Codice articolo 1680830384-2-1
Descrizione libro Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Codice articolo 9781680830385