Convergence of supermemory gradient method

DOI10.1007/BF02832325MaRDI QIDQ2454990zbMATH OpenFDO

Authors Jie Shen, Zhenjun Shi

Publication date 22 October 2007

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

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

zbMATH Keywords

global convergenceunconstrained optimizationsupermemory gradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Recommendations

• scientific article; zbMATH DE number 2150661
• Convergence of memory gradient methods
• A new class of supermemory gradient methods
• A supermemory gradient method for unconstrained optimization
• scientific article; zbMATH DE number 5926962
• A new supermemory gradient method for unconstrained optimization problems
• Supermemory gradient methods for monotone nonlinear equations with convex constraints
• A supermemory gradient method without line search
• CONVERGENCE PROPERTY AND MODIFICATIONS OF A MEMORY GRADIENT METHOD
• A supermemory gradient method based on the nonmonotone technique

Cites work

• scientific article; zbMATH DE number 1004164 (Why is no real title available?)
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 6173889 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A globally convergent version of the Polak-Ribière conjugate gradient method
• A new descent algorithm with curve search rule
• A new super-memory gradient method with curve search rule
• Conjugate Directions without Linear Searches
• Convergence of multi-step curve search method for unconstrained optimization
• Function minimization by conjugate gradients
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Global convergence result for conjugate gradient methods
• Memory gradient method for the minimization of functions
• On the Barzilai and Borwein choice of steplength for the gradient method
• Quadratically convergent algorithms and one-dimensional search schemes
• Relation between the memory gradient method and the Fletcher-Reeves method
• Study on a supermemory gradient method for the minimization of functions
• Supermemory descent methods for unconstrained minimization
• Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Two-Point Step Size Gradient Methods
• R-linear convergence of the Barzilai and Borwein gradient method

Cited in

(6)

• A new supermemory gradient method for unconstrained optimization problems
• A new class of supermemory gradient methods
• scientific article; zbMATH DE number 5926962 (Why is no real title available?)
• scientific article; zbMATH DE number 2150661 (Why is no real title available?)
• Convergence of subspace gradient method
• SABRINA: a stochastic subspace majorization-minimization algorithm

This page was built for publication: Convergence of supermemory gradient method

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