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

DOI10.1080/02331934.2014.895903zbMATH Open1337.90084OpenAlexW2019582417MaRDI QIDQ2808326FDOQ2808326

Authors: Min Li, Aiping Qu 

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

Recommendations

• Global convergence of a modified Liu-Storey conjugate gradient method
• A sufficient descent conjugate gradient method and its global convergence
• Convergence of Liu-Storey conjugate gradient method
• A new version of the Liu-Storey conjugate gradient method
• A Liu-Storey conjugate gradient method for solving large-scale nonlinear system of equations with global convergence
• Some sufficient descent conjugate gradient methods and their global convergence
• Global convergence of a class of sufficient descent conjugate gradient methods
• A new conjugate gradient method with strongly global convergence and sufficient descent condition
• The convergence property of a sufficient descent LS-type conjugates gradient method
• Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence

zbMATH Keywords

global convergenceconjugate gradient methodsufficient descent property

Mathematics Subject Classification ID

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

Cites Work

• Algorithm 851
• CUTE
• Benchmarking optimization software with performance profiles.
• Function minimization by conjugate gradients
• Line search algorithms with guaranteed sufficient decrease
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• 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
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
• A sufficient descent LS conjugate gradient method for unconstrained optimization problems

Cited In (6)

• Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems
• A new version of the Liu-Storey conjugate gradient method
• A modified conjugate gradient method with sufficient condition and conjugacy condition
• Global convergence of a modified Liu-Storey conjugate gradient method
• A sufficient descent LS conjugate gradient method for unconstrained optimization problems
• A derivative-free three-term projection algorithm involving spectral quotient for solving nonlinear monotone equations

Uses Software

• CUTEr

This page was built for publication: A sufficient descent Liu–Storey conjugate 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 Q2808326)