New three-term conjugate gradient method with guaranteed global convergence

DOI10.1080/00207160.2013.862236zbMath1302.90212OpenAlexW1966071118MaRDI QIDQ2935391

Jin-Kui Liu, Sheng Jie Li

Publication date: 29 December 2014

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2013.862236

zbMATH Keywords

unconstrained optimizationglobal convergenceconjugate gradient methodstandard Wolfe line searchpowell symmetrical technique

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (9)

An efficient modified residual-based algorithm for large scale symmetric nonlinear equations by approximating successive iterated gradients ⋮ An approximate gradient-type method for nonlinear symmetric equations with convex constraints ⋮ A family of quasi-Newton methods for unconstrained optimization problems ⋮ Some three-term conjugate gradient methods with the inexact line search condition ⋮ A norm descent derivative-free algorithm for solving large-scale nonlinear symmetric equations ⋮ Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization ⋮ Some three-term conjugate gradient methods with the new direction structure ⋮ A smoothing iterative method for the finite minimax problem ⋮ Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization

Cites Work

• Unnamed Item
• Unnamed Item
• On three-term conjugate gradient algorithms for unconstrained optimization
• A simple three-term conjugate gradient algorithm for unconstrained optimization
• Efficient generalized conjugate gradient algorithms. I: Theory
• A conjugate direction algorithm without line searches
• Further insight into the convergence of the Fletcher-Reeves method
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
• Conjugate Gradient Methods with Inexact Searches
• CUTE
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Function minimization by conjugate gradients
• Some descent three-term conjugate gradient methods and their global convergence
• Convergence Conditions for Ascent Methods
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• Benchmarking optimization software with performance profiles.

This page was built for publication: New three-term conjugate gradient method with guaranteed global convergence