Software for estimating sparse Hessian matrices
Thomas F. Coleman, B. S. Garbow, Jorge J. Morè · ACM Transactions on Mathematical Software · 1985
The solution of a nonlinear optimization problem often requires an estimate of the Hessian matrix for a function f . In large scale problems, the Hessian matrix is usually sparse, and then estimation by differences of gradients is attractive because the number of differences can be small compared to the dimension of the problem. In this paper we describe a set of subroutines whose purpose is to estimate the Hessian matrix with the least possible number of gradient evaluations.
Cited by 60 works. doi:10.1145/6187.6190
Authors
References
- A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront
- Smallest-last ordering and clustering and graph coloring algorithms
- Partitioned variable metric updates for large structured optimization problems
- On the Estimation of Sparse Hessian Matrices
- Software for estimating sparse Jacobian matrices
- Estimation of sparse hessian matrices and graph coloring problems
- The Choice of Step Lengths When Using Differences to Approximate Jacobian Matrices
- Optimal Estimation of Jacobian and Hessian Matrices That Arise in Finite Difference Calculations