Study on a supermemory gradient method for the minimization of functions

DOI10.1007/BF00930579zbMath0172.19002OpenAlexW2030071347MaRDI QIDQ2532077

A. V. Levy, E. E. Cragg

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

Related Items

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

Cites Work

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