GLOBAL CONVERGENCE OF A SPECIAL CASE OF THE DAI–YUAN FAMILY WITHOUT LINE SEARCH

DOI10.1142/S0217595908001663zbMath1163.90799OpenAlexW2044891299MaRDI QIDQ3526527

Hui Zhu, Xiongda Chen

Publication date: 25 September 2008

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595908001663

zbMATH Keywords

unconstrained optimizationglobal convergenceconjugate gradient methods

Mathematics Subject Classification ID

Methods of reduced gradient type (90C52)

Related Items (1)

Optimal atomic-resolution structures of prion AGAAAAGA amyloid fibrils

Uses Software

• minpack

Cites Work

• Unnamed Item
• Global convergence of a two-parameter family of conjugate gradient methods without line search
• Efficient generalized conjugate gradient algorithms. I: Theory
• Global convergence result for conjugate gradient methods
• A three-parameter family of nonlinear conjugate gradient methods
• Testing Unconstrained Optimization Software
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• Convergence properties of the Fletcher-Reeves method
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• Function minimization by conjugate gradients
• Convergence Conditions for Ascent Methods
• Methods of conjugate gradients for solving linear systems
• Global convergence of conjugate gradient methods without line search

This page was built for publication: GLOBAL CONVERGENCE OF A SPECIAL CASE OF THE DAI–YUAN FAMILY WITHOUT LINE SEARCH