Optimization for Sparse Systems.

Abstract

Sparse matrices with special structure arise in almost every application of large scale optimization. In linear programming, these problems usually are solved by pivoting procedures, most notably the simplex method, refined and modified in various ways to exploit structure. More recently iterative relaxation methods and dual ascent algorithms have been proposed for certain applications. In surveying several algorithms from each of these categories, this paper demonstrates the potential for investigating and applying sparse system techniques in optimization. (Author)

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1975
Accession Number
ADA018018

Entities

People

  • Thomas L. Magnanti

Organizations

  • Massachusetts Institute of Technology

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computational Complexity
  • Computations
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Linear Programming
  • Mathematical Analysis
  • Mathematics
  • Optimization
  • Simplex Method
  • Sparse Matrix

Readers

  • Operations Research
  • Systems Analysis and Design