A new descent memory gradient method and its global convergence

DOI10.1007/S11424-011-8150-0MaRDI QIDQ1937779zbMATH OpenOpenAlexFDO

Authors M. Sun, Qingguo Bai

Publication date 31 January 2013

Published in Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11424-011-8150-0

zbMATH Keywords

global convergencememory gradient methodsufficiently descent

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Methods of reduced gradient type (90C52)

Recommendations

• A new class of memory gradient methods and its global convergence
• A new memory gradient method and its convergence
• Global convergence of a memory gradient method for unconstrained optimization
• A new variant of the memory gradient method for unconstrained optimization
• scientific article; zbMATH DE number 5951924

Cites work

• A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• A globally convergent Polak-Ribière-Polyak conjugate gradient method with Armijo-type line search
• A new memory gradient method under exact line search
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A Two-Term PRP-Based Descent Method
• Convergence of Liu-Storey conjugate gradient method
• Convergence of the Polak-Ribiére-Polyak conjugate gradient method
• Convergence properties of the dependent PRP conjugate gradient methods
• Function minimization by conjugate gradients
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
• Methods of conjugate gradients for solving linear systems
• On the convergence of a new hybrid projection algorithm
• The conjugate gradient method in extremal problems
• The convergence properties of some new conjugate gradient methods

Cited in

(10)

• Strong solutions and global attractors for Kirchhoff type equation
• A Shamanskii-like self-adaptive Levenberg-Marquardt method for nonlinear equations
• A class of derivative-free CG projection methods for nonsmooth equations with an application to the LASSO problem
• Discrete-time Zhang neural networks for time-varying nonlinear optimization
• A memory gradient method based on the nonmonotone technique
• GLOBAL CONVERGENCE RESULTS OF A NEW THREE-TERM MEMORY GRADIENT METHOD
• scientific article; zbMATH DE number 5951924 (Why is no real title available?)
• Supermemory gradient methods for monotone nonlinear equations with convex constraints
• Two improved conjugate gradient methods with application in compressive sensing and motion control
• A globally convergent Riemannian memory gradient method

This page was built for publication: A new descent memory gradient method and its global convergence

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