ACM Home Page
Please provide us with feedback. Feedback
Software for estimating sparse Hessian matrices
Full text PdfPdf (1.18 MB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 11 ,  Issue 4  (December 1985) table of contents
Pages: 363 - 377  
Year of Publication: 1985
ISSN:0098-3500
Authors
Thomas F. Coleman  Cornell Univ., Ithaca, NY
Burton S. Garbow  Argonne National Laboratory, Argonne, IL
Jorge J. Moré  Argonne National Laboratory, Argonne, IL
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 48,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/6187.6190
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
COLEMAN, T. F. AND MOR~, J.J. Estimation of sparse Hessian matrices and graph coloring problems. Math. Program. 28, (Apr. 1984), 243-270.
 
3
CURTIS, A. R. AND REID, J.K. The choice of step lengths when using differences to approximate Jacobian matrices. J. Inst. Math. Appl. 13, (Feb. 1974), 121-126.
 
4
EVERSTINE, G.C. A comparison of three resequencing algorithms for the reduction of matrix profile and wavefront. Int. J. Numer. Meth. Eng. 14, (June 1980), 837-853.
 
5
GILL, P. E., MURRAY, W. AND WRIGHT, M.H. Practical Optimization. Academic Press, New York, 1981.
 
6
GOLDFARB, D. AND TOINT, P.L. Optimal estimation of Jacobian and Hessian matrices that arise in finite difference calculations. Math. Comp. 43, (July 1984), 69-88.
 
7
GRIEWANK, A. AND TOINT, P. L. Partitioned variable metric updates for large structured optimization problems. Numer. Math. 39, (June 1982), 119-137.
 
8
MATULA, D.W. A rain-max theorem for graphs with application to graph coloring. SIAM Rev. 10, (Oct. 1968), 481-482.
9
 
10
POWELL, M. J. D. AND TOINT, P.L. On the estimation of sparse Hessian matrices, SIAM J. Numer. Anal. 16, (Dec. 1979), 1060-1074.



REVIEW

"A. Chris Rolls Newbery : Reviewer"

Given a scalar function of n variables, the i-jth element of the Hessian is fxy, where x and y are the ith and jth independent variables. It may happen tha  more...

Collaborative Colleagues:
Thomas F. Coleman: colleagues
Burton S. Garbow: colleagues
Jorge J. Moré: colleagues

Peer to Peer - Readers of this Article have also read: