On the efficient computation of sparsity patterns for Hessians
DOI10.1007/978-3-642-30023-3_13zbMATH Open1251.65037OpenAlexW33624625MaRDI QIDQ2913125FDOQ2913125
Authors: Andrea Walther 
Publication date: 26 September 2012
Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-30023-3_13
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
numerical examplesalgorithmlarge-scale problemssecond order derivativesconservative second-order dependenciesnonlinear frontiersnonlinear interaction domainssparsity patterns for Hessians
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical differentiation (65D25)
Cited In (9)
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
- Title not available (Why is that?)
- 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
- Efficient detection of Hessian matrix sparsity pattern
- Title not available (Why is that?)
- Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation
- Pattern graph for sparse Hessian matrix
Uses Software
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)
