Skip to main content


eCommons@Cornell

eCommons@Cornell >
Faculty of Computing and Information Science >
Center for Advance Computing >
Cornell Theory Center Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/5588
Title: Structure and Efficient Hessian Calculation
Authors: Coleman, Thomas F.
Verma, Arun
Keywords: theory center
Hessian matrix
automatic differentiation
structured computation
sparsity
Issue Date: Aug-1996
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.tc/96-258
Abstract: Modern methods for numerical optimization calculate (or approximate) the matrix of second derivatives, the Hessian matrix, at each iteration. The recent arrival of robust software for automatic differentiation allows for the possibility of automatically computing the Hessian matrix, and the gradient, given a code to evaluate the objective function itself. However, for large-scale problems direct application of automatic differentiation may be unacceptably expensive. Recent work has shown that this cost can be dramatically reduced in the presence of sparsity. In this paper we show that for structured problems it is possible to apply automatic differentiation tools in an economical way - even in the absence of sparsity in the Hessian.
URI: http://hdl.handle.net/1813/5588
Appears in Collections:Cornell Theory Center Technical Reports

Files in This Item:

File Description SizeFormat
96-258.pdf211.98 kBAdobe PDFView/Open
96-258.ps246.59 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us