Study on a supermemory gradient method for the minimization of functions

DOI10.1007/BF00930579MaRDI QIDQ2532077zbMATH OpenOpenAlexFDO

Authors E. E. Cragg, A. V. Levy

Publication date 1969

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

Full work available at URL https://doi.org/10.1007/bf00930579

zbMATH Keywords

numerical analysis

Cites work

• Function minimization by conjugate gradients
• Memory gradient method for the minimization of functions
• Properties of the conjugate-gradient and Davidon methods

Cited in

(33)

• Generalized conjugate directions
• A supermemory gradient projection algorithm for optimization problems with nonlinear constraints
• Supermemory descent methods for unconstrained minimization
• Approximation methods for the unconstrained optimization
• Extensions of CGS algorithms: Generalized least-square solutions
• The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables
• Conjugate gradient methods using value of objective function for unconstrained optimization
• A new descent algorithm with curve search rule
• Pseudo-conjugate directions for the solution of the nonlinear unconstrained optimization problem on a parallel computer
• An optimal subgradient algorithm with subspace search for costly convex optimization problems
• Convergence of supermemory gradient method
• A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization
• Memory gradient method with Goldstein line search
• On memory gradient method with trust region for unconstrained optimization
• Numerical experiments on quadratically convergent algorithms for function minimization
• Quadratically convergent algorithms and one-dimensional search schemes
• Numerical experiments on dual matrix algorithms for function minimization
• Memory gradient method for multiobjective optimization
• New conjugate gradient-like methods for unconstrained optimization
• Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
• Optimal simultaneous maximuma posterioriestimation of states, noise statistics and parameters I. Algorithm
• Generalized memory gradient projection method for non-linear programming with non-linear equality and in-equality constraints
• A gradient-related algorithm with inexact line searches
• A local MM subspace method for solving constrained variational problems in image recovery
• A globally convergent Riemannian memory gradient method
• A nonmonotone supermemory gradient algorithm for unconstrained optimization
• Global convergence of modified HS conjugate gradient method
• Global convergence of a memory gradient method for unconstrained optimization
• A new class of supermemory gradient methods
• Strong global convergence of an adaptive nonmonotone memory gradient method
• On the convergence of a new hybrid projection algorithm
• Global convergence of a memory gradient method without line search
• A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization

This page was built for publication: Study on a supermemory gradient method for the minimization of functions

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