A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties

DOI10.1007/S11075-011-9515-0MaRDI QIDQ415335zbMATH OpenOpenAlexFDO

Authors Kairong Wang, Yang Zhang

Publication date 8 May 2012

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11075-011-9515-0

zbMATH Keywords

numerical resultsglobal convergenceconjugate gradient methodline searchsufficient descent conditionconjugate-descent-typeDai-Yuan-typeHestenes-StiefelLiu-StoreyPolak-Ribière-Polyak

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• Global convergence of a class of new conjugate gradient methods
• Global convergence of a class of sufficient descent conjugate gradient methods
• Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
• scientific article; zbMATH DE number 1159286
• scientific article; zbMATH DE number 1549856

Cites work

• scientific article; zbMATH DE number 3843083 (Why is no real title available?)
• scientific article; zbMATH DE number 3526471 (Why is no real title available?)
• scientific article; zbMATH DE number 1243473 (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 Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A class of globally convergent conjugate gradient methods
• Algorithm 851
• Benchmarking optimization software with performance profiles.
• CUTE
• Convergence Conditions for Ascent Methods
• Convergence Conditions for Ascent Methods. II: Some Corrections
• Convergence Properties of Algorithms for Nonlinear Optimization
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Methods of conjugate gradients for solving linear systems
• New properties of a nonlinear conjugate gradient method
• On the convergence property of the DFP algorithm
• On the limited memory BFGS method for large scale optimization

Cited in

(5)

• Algorithm 851
• New conjugate gradient-like methods for unconstrained optimization
• A new nonlinear conjugate gradient method with guaranteed global convergence
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Several guaranteed descent conjugate gradient methods for unconstrained optimization

Describes a project that uses

Uses Software

• CUTE
• CG_DESCENT
• CUTEr
• L-BFGS

This page was built for publication: A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties

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