Accession Number : AD0856000

Title :   Gradient Methods in Mathematical Programming Part 2. Memory Gradient Method,

Corporate Author : RICE UNIV HOUSTON TX AERO-ASTRONAUTICS GROUP

Personal Author(s) : Miele, A. ; Cantrell, J. W.

Report Date : 1969

Pagination or Media Count : 33

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. (Author)

Descriptors :   (*MATHEMATICAL PROGRAMMING, ITERATIONS), COMPUTER PROGRAMMING, PARTIAL DIFFERENTIAL EQUATIONS, NUMERICAL ANALYSIS, DIFFERENCE EQUATIONS, MATRICES(MATHEMATICS), CONVERGENCE, ALGORITHMS.

Subject Categories : Operations Research
      Computer Programming and Software

Distribution Statement : APPROVED FOR PUBLIC RELEASE