A sufficient descent LS conjugate gradient method for unconstrained optimization problems

DOI10.1016/J.AMC.2011.06.034MaRDI QIDQ654620zbMATH OpenOpenAlexFDO

Authors Min Li, Heying Feng

Publication date 29 December 2011

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2011.06.034

zbMATH Keywords

global convergenceconjugate gradient methodsufficient descent propertystrong Wolfe line searchLiu-Storey method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Recommendations

• A sufficient descent Liu–Storey conjugate gradient method and its global convergence
• Global convergence of a modified Liu-Storey conjugate gradient method
• Global convergence of a modified LS conjugate gradient method
• The convergence property of a sufficient descent LS-type conjugates gradient method
• Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization

Cites work

• scientific article; zbMATH DE number 3526471 (Why is no real title available?)
• scientific article; zbMATH DE number 3278849 (Why is no real title available?)
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
• A survey of nonlinear conjugate gradient methods
• Benchmarking optimization software with performance profiles.
• CUTE
• Convergence Conditions for Ascent Methods
• Convergence Conditions for Ascent Methods. II: Some Corrections
• Convergence of Liu-Storey conjugate gradient method
• Function minimization by conjugate gradients
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Line search algorithms with guaranteed sufficient decrease
• Methods of conjugate gradients for solving linear systems
• The conjugate gradient method in extremal problems

Cited in

(15)

• A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations
• A derivative-free Liu-Storey method for solving large-scale nonlinear systems of equations
• A sufficient descent Liu–Storey conjugate gradient method and its global convergence
• An Liu-Storey-type method for solving large-scale nonlinear monotone equations
• scientific article; zbMATH DE number 7109378 (Why is no real title available?)
• The convergence property of a sufficient descent LS-type conjugates gradient method
• A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method
• A study of Liu-Storey conjugate gradient methods for vector optimization
• An efficient hybrid conjugate gradient method for unconstrained optimisation
• Some sufficient descent conjugate gradient methods and their global convergence
• Some new descent nonlinear conjugate gradient methods for unconstrained optimization problems with global convergence
• A three-term conjugate gradient algorithm with restart procedure to solve image restoration problems
• A family of limited memory three term conjugate gradient methods
• A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
• A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations

Describes a project that uses

Uses Software

• CUTE
• CUTEr

This page was built for publication: A sufficient descent LS conjugate gradient method for unconstrained optimization problems

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