Gradient Methods in Mathematical Programming Part 3. Supermemory Gradient Method,

Abstract

A generalization of the memory gradient algorithm, called the supermemory gradient algorithm, is investigated. While the memory gradient algorithm is based on remembering one previous iteration, the supermemory gradient algorithm is based on remembering k previous iterations. The added complication is the need for a (k + 1)-dimensional search at each iteration as opposed to the two-dimensional search required by the memory gradient algorithm . (Author)

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1969
Accession Number
AD0856001

Entities

People

  • A. V. Levy
  • E. E. Cragg

Organizations

  • Rice University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Iterations
  • Mathematical Programming
  • Mathematics
  • Two Dimensional

Fields of Study

  • Computer science

Readers

  • Artificial Intelligence
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Operations Research