Some three-term conjugate gradient methods with the inexact line search condition

DOI10.1007/s10092-018-0258-3zbMath1393.90116OpenAlexW2790273519MaRDI QIDQ723556

Li-Min Zou, Jin-Kui Liu, Yu-Ming Feng

Publication date: 24 July 2018

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10092-018-0258-3

zbMATH Keywords

global convergencethree-term conjugate gradient methodsufficient descent propertyunconstrained optimization problem

Mathematics Subject Classification ID

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

Related Items (8)

Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization ⋮ A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems ⋮ An approximate gradient-type method for nonlinear symmetric equations with convex constraints ⋮ Modified three-term conjugate gradient method and its applications ⋮ Some three-term conjugate gradient methods with the new direction structure ⋮ Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications ⋮ Least-squares-based three-term conjugate gradient methods ⋮ A class of line search-type methods for nonsmooth convex regularized minimization

Uses Software

• CUTEr
• CUTE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On three-term conjugate gradient algorithms for unconstrained optimization
• A simple three-term conjugate gradient algorithm for unconstrained optimization
• A new class of nonlinear conjugate gradient coefficients with global convergence properties
• An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
• A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches
• Efficient generalized conjugate gradient algorithms. I: Theory
• A conjugate direction algorithm without line searches
• New three-term conjugate gradient method with guaranteed global convergence
• A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Updating Quasi-Newton Matrices with Limited Storage
• CUTE
• 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
• 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: Some three-term conjugate gradient methods with the inexact line search condition