A modified three-term conjugate gradient method with sufficient descent property

DOI10.1007/s11766-015-3276-9zbMath1349.90786OpenAlexW3035830275MaRDI QIDQ530722

Babaiekafaki Saman

Publication date: 10 August 2016

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-015-3276-9

zbMATH Keywords

unconstrained optimizationglobal convergenceeigenvalueconjugate gradient methodsufficient descent condition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31)

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
• An eigenvalue study on the sufficient descent property of a modified Polak-Ribière-Polyak conjugate gradient method
• A conjugate gradient method with descent direction for unconstrained optimization
• New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
• Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
• Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
• A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
• Optimization theory and methods. Nonlinear programming
• A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization
• Two Modified Polak–Ribière–Polyak-Type Nonlinear Conjugate Methods with Sufficient Descent Property
• A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Algorithm 851
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Two-Term PRP-Based Descent Method
• CUTEr and SifDec
• The conjugate gradient method in extremal problems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Mathematical theory of optimization
• Benchmarking optimization software with performance profiles.

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