Relation between the memory gradient method and the Fletcher-Reeves method

DOI10.1007/BF00928717zbMath0167.08804MaRDI QIDQ2530377

J. W. Cantrell

Publication date: 1969

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

ordinary differential equations

Related Items (15)

Generalized conjugate directions ⋮ A new class of supermemory gradient methods ⋮ A gradient-related algorithm with inexact line searches ⋮ A new variant of the memory gradient method for unconstrained optimization ⋮ Recent advances in unconstrained optimization ⋮ Convergence of supermemory gradient method ⋮ Memory gradient method with Goldstein line search ⋮ A new descent algorithm with curve search rule ⋮ Generalized memory gradient projection method for non-linear programming with non-linear equality and in-equality constraints ⋮ On memory gradient method with trust region for unconstrained optimization ⋮ Multi-search optimization techniques ⋮ Approximation methods for the unconstrained optimization ⋮ Memory gradient method for the minimization of functions ⋮ Relation between the memory gradient method and the Fletcher-Reeves method ⋮ Unified approach to quadratically convergent algorithms for function minimization

Cites Work

• Memory gradient method for the minimization of functions
• Relation between the memory gradient method and the Fletcher-Reeves method
• Function minimization by conjugate gradients

This page was built for publication: Relation between the memory gradient method and the Fletcher-Reeves method