Convergence of the Polak-Ribiére-Polyak conjugate gradient method

DOI10.1016/j.na.2006.02.001zbMath1120.49027OpenAlexW1989508125MaRDI QIDQ869834

Jie Shen, Zhen-Jun Shi

Publication date: 9 March 2007

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2006.02.001

zbMATH Keywords

unconstrained optimizationglobal convergenceWolfe line searchArmijo line searchPolak-Ribiére-Polyak conjugate gradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (13)

A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery ⋮ The convergence of conjugate gradient method with nonmonotone line search ⋮ Two modified HS type conjugate gradient methods for unconstrained optimization problems ⋮ Coupling finite element and reliability analysis through proper generalized decomposition model reduction ⋮ A new descent memory gradient method and its global convergence ⋮ On the strong convergence of a sufficient descent Polak-Ribière-Polyak conjugate gradient method ⋮ The hybrid BFGS-CG method in solving unconstrained optimization problems ⋮ Global convergence of a modified Hestenes-Stiefel nonlinear conjugate gradient method with Armijo line search ⋮ Two new conjugate gradient methods based on modified secant equations ⋮ An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems ⋮ Two Modified Polak–Ribière–Polyak-Type Nonlinear Conjugate Methods with Sufficient Descent Property ⋮ A new family of conjugate gradient methods ⋮ A novel method of dynamic force identification and its application

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Step-size estimation for unconstrained optimization methods
• Quadratic cost flow and the conjugate gradient method
• Generalized Polak-Ribière algorithm
• A globally convergent version of the Polak-Ribière conjugate gradient method
• On the asymptotic behaviour of some new gradient methods
• Minimization of functions having Lipschitz continuous first partial derivatives
• Convergence of descent method without line search
• Testing Unconstrained Optimization Software
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Conjugate Gradient Methods with Inexact Searches
• On the Convergence of a New Conjugate Gradient Algorithm
• Numerical Optimization
• Rate of Convergence of Several Conjugate Gradient Algorithms
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method
• Function minimization by conjugate gradients
• Convergence Conditions for Ascent Methods
• On Steepest Descent
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• A spectral conjugate gradient method for unconstrained optimization
• New properties of a nonlinear conjugate gradient method
• Global convergence of conjugate gradient methods without line search

This page was built for publication: Convergence of the Polak-Ribiére-Polyak conjugate gradient method