Memory gradient method for the minimization of functions
From MaRDI portal
Publication:2529760
DOI10.1007/BF00929359zbMath0165.22702OpenAlexW1986082458MaRDI QIDQ2529760
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/bf00929359
Related Items (37)
A truncated Newton method with non-monotone line search for unconstrained optimization ⋮ 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 ⋮ New imperfect conjugate gradient algorithm ⋮ 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 ⋮ A mixed-discrete particle swarm optimization algorithm with explicit diversity-preservation ⋮ Recent advances in unconstrained optimization ⋮ 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 ⋮ Convergence of memory gradient methods ⋮ A response surface method-based hybrid optimizer ⋮ Convergence of supermemory gradient method ⋮ Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems ⋮ Iterative computation of negative curvature directions in large scale 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 ⋮ Multi-search optimization techniques ⋮ Approximation methods for the unconstrained optimization ⋮ A nonmonotone supermemory gradient algorithm for unconstrained optimization ⋮ Relation between the memory gradient method and the Fletcher-Reeves method ⋮ A generalized conjugate gradient algorithm ⋮ Study on a supermemory gradient method for the minimization of functions ⋮ Unified approach to quadratically convergent algorithms for function minimization ⋮ Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory ⋮ SABRINA: a stochastic subspace majorization-minimization algorithm ⋮ Successive element correction algorithms for sparse unconstrained optimization
Cites Work
This page was built for publication: Memory gradient method for the minimization of functions
