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

DOI10.1007/BF00928717MaRDI QIDQ2530377zbMATH OpenFDO

Authors J. W. Cantrell

Publication date 1969

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

zbMATH Keywords

ordinary differential equations

Cites work

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

Cited in

(16)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2530377)