Two modified three-term conjugate gradient methods with sufficient descent property

DOI10.1007/s11590-014-0736-8zbMath1309.90097OpenAlexW2241952309WikidataQ57952823 ScholiaQ57952823MaRDI QIDQ479259

Reza Ghanbari, Saman Babaie-Kafaki

Publication date: 5 December 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0736-8

zbMATH Keywords

unconstrained optimizationglobal convergencelarge-scale optimizationconjugate gradient algorithmsecant equationsufficient descent condition

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Related Items (18)

An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update ⋮ Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing ⋮ Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme ⋮ A Dai-Liao conjugate gradient method via modified secant equation for system of nonlinear equations ⋮ A new modified three-term conjugate gradient method with sufficient descent property and its global convergence ⋮ An adaptive modified three-term conjugate gradient method with global convergence ⋮ A class of three-term derivative-free methods for large-scale nonlinear monotone system of equations and applications to image restoration problems ⋮ A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence ⋮ An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method ⋮ An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction ⋮ Some nonlinear conjugate gradient methods based on spectral scaling secant equations ⋮ A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique ⋮ Unnamed Item ⋮ Least-squares-based three-term conjugate gradient methods ⋮ An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix ⋮ Two classes of spectral conjugate gradient methods for unconstrained optimizations

Uses Software

• CUTEr
• CG_DESCENT

Cites Work

• Unnamed Item
• Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
• Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
• Two new conjugate gradient methods based on modified secant equations
• Another hybrid conjugate gradient algorithm for unconstrained optimization
• Optimization theory and methods. Nonlinear programming
• A nonlinear conjugate gradient method based on the MBFGS secant condition
• Algorithm 851
• Some descent three-term conjugate gradient methods and their global convergence
• CUTEr and SifDec
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• A modified BFGS method and its global convergence in nonconvex minimization
• Mathematical theory of optimization
• Benchmarking optimization software with performance profiles.

This page was built for publication: Two modified three-term conjugate gradient methods with sufficient descent property