Show simple item record

dc.contributor.authorColeman, Thomas F.en_US
dc.contributor.authorMore, Jorge J.en_US
dc.description.abstractLarge scale optimization problems often require an approximation to the Hessian matrix. If the Hessian matrix is sparse then estimation by differences of gradients is attractive because the number of required differences is usually small compared to the dimension of the problem. The problem of estimating Hessian matrices by diferences can be phrased as follows: Given the sparsity structure of a symmetric matrix $A$, obtain vectors $d_{1},d_{2},\ldots,d_{p}$ such that $Ad_{1},Ad_{2},\ldots,Ad_{p}$ determine $A$ uniquely with $p$ as small as possible. We approach this problem from a graph theoretic point of view and show that both direct and indirect approaches to this problem have a natural graph coloring interpretation. The complexity of the problem is analyzed and efficient practical heuristic procedures are developed. Numerical results illustrate the differences between the various approaches.en_US
dc.format.extent2893315 bytes
dc.format.extent550641 bytes
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleEstimation of Sparse Hessian Matrices and Graph Coloring Problemsen_US
dc.typetechnical reporten_US

Files in this item


This item appears in the following Collection(s)

Show simple item record