Gradient Methods in Mathematical Programming Part 2. Memory Gradient Method

Abstract

A generalization of the Fletcher-Reeves algorithm is investigated. This generalization retains the property of quadratic convergence, simplicity of concept, and small storage requirement, while yielding shorter computing time. The only added complication is the need for a two-dimensional search at each iteration as opposed to the one-dimensional search required by the Fletcher-Reeves algorithm.

Open PDF

Document Details

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

Entities

People

  • Angelo Miele
  • J. W. Cantrell

Organizations

  • Rice University

Tags

Communities of Interest

  • Space

DTIC Thesaurus Topics

  • Accuracy
  • Air Force
  • Algorithms
  • Astronautics
  • Computer Programming
  • Computers
  • Convergence
  • Digital Computers
  • Engineering
  • Iterations
  • Materials
  • Materials Science
  • Mathematical Programming
  • New York
  • Precision
  • Scalar Functions
  • Scientific Research
  • Two Dimensional
  • United States

Readers

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