A Combinatorial Approach to Some Sparse Matrix Problems

Front Cover
Stanford University, 1983 - Combinatorial analysis - 284 pages
0 Reviews
This dissertation considers two combinatorial problems arising in large-scale, sparse optimizaton. The first is the problem of approximating the Hessian matrix of a smooth, non-linear function by finite differencing, where the object is to minimize the required number of gradient evaluations. The second is to find as sparse a representation as possible of a given set of linear constraints.

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Introduction
1
Making Sparse Matrices Sparser
36
Bibliography 68
69

Bibliographic information