A sufficient descent Liu–Storey conjugate gradient method and its global convergence

DOI10.1080/02331934.2014.895903zbMath1337.90084OpenAlexW2019582417MaRDI QIDQ2808326

Aiping Qu, Min Li

Publication date: 23 May 2016

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2014.895903

zbMATH Keywords

global convergenceconjugate gradient methodsufficient descent property

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Methods of quasi-Newton type (90C53)

Related Items (2)

Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems ⋮ A derivative-free three-term projection algorithm involving spectral quotient for solving nonlinear monotone equations

Uses Software

• CUTEr

Cites Work

• A sufficient descent LS conjugate gradient method for unconstrained optimization problems
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Algorithm 851
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• CUTE
• Line search algorithms with guaranteed sufficient decrease
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Function minimization by conjugate gradients
• Convergence Conditions for Ascent Methods
• Convergence Conditions for Ascent Methods. II: Some Corrections
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Benchmarking optimization software with performance profiles.

This page was built for publication: A sufficient descent Liu–Storey conjugate gradient method and its global convergence