Some sufficient descent conjugate gradient methods and their global convergence

DOI10.1007/s40314-013-0064-0zbMath1307.90171OpenAlexW1994778783MaRDI QIDQ2514055

Aiping Qu, Min Li

Publication date: 30 January 2015

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-013-0064-0

zbMATH Keywords

global convergencenonlinear conjugate gradient methodsufficient descent property

Mathematics Subject Classification ID

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

Related Items (8)

A family of conjugate gradient methods for large-scale nonlinear equations ⋮ A two-stage approach for structural damage detection using a damage localization indicator vector and cluster particle swarm optimization ⋮ A hybrid conjugate gradient algorithm for nonconvex functions and its applications in image restoration problems ⋮ Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems ⋮ A modified nonlinear conjugate gradient method with the Armijo line search and its application ⋮ A family of Hager-Zhang conjugate gradient methods for system of monotone nonlinear equations ⋮ Spectral modified Polak-Ribiére-Polyak projection conjugate gradient method for solving monotone systems of nonlinear equations ⋮ Modified HS conjugate gradient method for solving generalized absolute value equations

Uses Software

• CUTEr
• CG_DESCENT
• CUTE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A sufficient descent LS conjugate gradient method for unconstrained optimization problems
• Efficient generalized conjugate gradient algorithms. I: Theory
• A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
• New versions of the Hestenes-Stiefel nonlinear conjugate gradient method based on the secant condition for optimization
• A globally convergent version of the Polak-Ribière conjugate gradient method
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Algorithm 851
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Conjugate Gradient Methods with Inexact Searches
• CUTE
• Line search algorithms with guaranteed sufficient decrease
• Convergence properties of the Fletcher-Reeves method
• 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
• Convergence Conditions for Ascent Methods
• Convergence Conditions for Ascent Methods. II: Some Corrections
• The conjugate gradient method in extremal problems
• 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
• Benchmarking optimization software with performance profiles.

This page was built for publication: Some sufficient descent conjugate gradient methods and their global convergence