GLOBAL CONVERGENCE OF TWO KINDS OF THREE-TERM CONJUGATE GRADIENT METHODS WITHOUT LINE SEARCH

DOI10.1142/S0217595912500431zbMath1262.90194OpenAlexW2104690606MaRDI QIDQ4921468

Liang Yin, Xiongda Chen

Publication date: 10 May 2013

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

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

zbMATH Keywords

unconstrained optimizationglobal convergencethree-term conjugate gradient methods

Mathematics Subject Classification ID

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

Related Items (1)

Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing

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
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Testing Unconstrained Optimization Software
• Restart procedures for the conjugate gradient method
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• Function minimization by conjugate gradients
• Some descent three-term conjugate gradient methods and their global convergence
• 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 TWO KINDS OF THREE-TERM CONJUGATE GRADIENT METHODS WITHOUT LINE SEARCH