GLOBAL CONVERGENCE OF SHORTEST-RESIDUAL FAMILY OF CONJUGATE GRADIENT METHODS WITHOUT LINE SEARCH

DOI10.1142/S0217595905000716zbMath1158.90422MaRDI QIDQ5716136

Xiongda Chen, Xia Li

Publication date: 9 January 2006

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

zbMATH Keywords

global convergenceconjugate gradientline searchshortest residual

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Related Items (1)

Optimal atomic-resolution structures of prion AGAAAAGA amyloid fibrils

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 of the method of shortest residuals
• Testing Unconstrained Optimization Software
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• On the convergence of conjugate gradient algorithms
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• Function minimization by conjugate gradients
• Methods of conjugate gradients for solving linear systems

This page was built for publication: GLOBAL CONVERGENCE OF SHORTEST-RESIDUAL FAMILY OF CONJUGATE GRADIENT METHODS WITHOUT LINE SEARCH