A Combinatorial Approach to Some Sparse Matrix Problems.

Abstract

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1983
Accession Number
ADA131387

Entities

People

  • S. Thomas Mccormick

Organizations

  • Stanford University

Tags

Communities of Interest

  • C4I
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Computational Complexity
  • Computer Programming
  • Computers
  • Graph Theory
  • Heuristic Methods
  • Linear Accelerators
  • Linear Algebra
  • Linear Programming
  • Linear Systems
  • Military Research
  • New York
  • Notation
  • Numerical Analysis
  • Operations Research
  • Optimization
  • Simplex Method

Readers

  • Approximation Theory.
  • Computer Vision.