On the Efficient Computation of Sparsity Patterns for Hessians

DOI10.1007/978-3-642-30023-3_13zbMath1251.65037OpenAlexW33624625MaRDI QIDQ2913125

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

zbMATH Keywords

algorithmnumerical exampleslarge-scale problemssecond order derivativesconservative second-order dependenciesnonlinear frontiersnonlinear interaction domainssparsity patterns for Hessians

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical differentiation (65D25)

Related Items (2)

Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation ⋮ Computing the sparsity pattern of Hessians using automatic differentiation

Uses Software

• ADOL-C
• CUTEr
• SifDec
• ColPack
• hess_pat

This page was built for publication: On the Efficient Computation of Sparsity Patterns for Hessians