Estimation of sparse hessian matrices and graph coloring problems
- 209 Downloads
Large 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 differences can be phrased as follows: Given the sparsity structure of a symmetric matrixA, obtain vectorsd 1,d 2, …d p such thatAd 1,Ad 2, …Ad p determineA uniquely withp 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.
Key wordsGraph Coloring Estimation of Hessian Matrices Sparsity Differentiation Numerical Differences NP-Complete Problems Unconstrained Minimization
Unable to display preview. Download preview PDF.
- T.F. Coleman and J.J. Moré, “Software for estimating sparse Jacobian matrices”, Technical Report ANL-82-37, Argonne National Laboratory (Argonne, Illinois, 1982).Google Scholar
- S. Eisenstat, Personal communication (1980).Google Scholar
- D.W. Matula, G. Marble and J.D. Isaacson, “Graph coloring algorithms”, in: R. Read, ed.,Graph theory and computing (Academic Press, New York, 1972), pp. 104–122.Google Scholar
- G.N. Newsam and J.D. Ramsdell, “Estimation of sparse Jacobian matrices”,SIAM Journal of Algebraic and Discrete Methods (1983), to appear.Google Scholar
- M.N. Thapa, “Optimization of unconstrained functions with sparse Hessian matrices: Newton-type methods”, Technical Report SOL 82-8, Systems Optimization Laboratory, Stanford University (Stanford, CA, 1982).Google Scholar