On the efficient computation of sparsity patterns for Hessians
From MaRDI portal
Publication:2913125
Recommendations
- Efficient detection of Hessian matrix sparsity pattern
- Computing the sparsity pattern of Hessians using automatic differentiation
- Computing sparse Hessians with automatic differentiation
- Pattern graph for sparse Hessian matrix
- Exploiting sparsity in automatic differentiation on multicore architectures
Cited in
(9)- Pattern graph for sparse Hessian matrix
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
- scientific article; zbMATH DE number 3936369 (Why is no real title available?)
- Computing sparse Hessians with automatic differentiation
- Computing the sparsity pattern of Hessians using automatic differentiation
- A note on direct methods for approximations of sparse Hessian matrices
- scientific article; zbMATH DE number 1101645 (Why is no real title available?)
- Efficient detection of Hessian matrix sparsity pattern
- Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation
This page was built for publication: On the efficient computation of sparsity patterns for Hessians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913125)
