Edge pushing is equivalent to vertex elimination for computing Hessians
From MaRDI portal
Publication:6539151
Recommendations
- A new framework for the computation of Hessians
- Computing the sparsity pattern of Hessians using automatic differentiation
- Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation
- On efficient Hessian computation using the edge pushing algorithm in Julia
- A polynomial-time algorithm for detecting directed axial symmetry in Hessian computational graphs
This page was built for publication: Edge pushing is equivalent to vertex elimination for computing Hessians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6539151)
