Computing the sparsity pattern of Hessians using automatic differentiation
From MaRDI portal
Publication:5498686
Recommendations
- Computing sparse Hessians with automatic differentiation
- Efficient computation of sparse hessians using coloring and automatic differentiation
- On the efficient computation of sparsity patterns for Hessians
- Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation
- The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
- Computing Large Sparse Jacobian Matrices Using Automatic Differentiation
- Exploiting sparsity in automatic differentiation on multicore architectures
- Automatic differentiation of large sparse systems
- Automatic differentiation: Reduced gradient and reduced Hessian matrix
- The Efficient Computation of Structured Gradients using Automatic Differentiation
Cites work
- scientific article; zbMATH DE number 992821 (Why is no real title available?)
- scientific article; zbMATH DE number 3898623 (Why is no real title available?)
- scientific article; zbMATH DE number 1253977 (Why is no real title available?)
- A new framework for the computation of Hessians
- Algorithm 755: ADOL-C
- Algorithm 799: revolve
- Automatic Hessians by reverse accumulation
- CUTE
- Computing sparse Hessians with automatic differentiation
- Efficient computation of sparse hessians using coloring and automatic differentiation
- Evaluating Derivatives
- On the efficient computation of sparsity patterns for Hessians
- Some bounds on the complexity of gradients, Jacobians, and Hessians
- Test example for nonlinear programming codes
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
Cited in
(10)- Pattern graph for sparse Hessian matrix
- A new framework for the computation of Hessians
- Computing sparse Hessians with automatic differentiation
- On the efficient computation of sparsity patterns for Hessians
- On efficient Hessian computation using the edge pushing algorithm in Julia
- scientific article; zbMATH DE number 1101645 (Why is no real title available?)
- Efficient computation of sparse hessians using coloring and automatic differentiation
- Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation
- Edge pushing is equivalent to vertex elimination for computing Hessians
- Improved Automatic Computation of Hessian Matrix Spectral Bounds
This page was built for publication: Computing the sparsity pattern of Hessians using automatic differentiation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5498686)
