A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization

DOI10.1080/02331931003653187zbMath1233.90255OpenAlexW1978386996MaRDI QIDQ3111146

Neculai Andrei

Publication date: 18 January 2012

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

unconstrained optimizationconjugacy conditionnumerical comparisonssufficient descent conditionPolak-Ribière-Polyak conjugate gradient method

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Related Items

An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems ⋮ A descent extension of the Polak-Ribière-Polyak conjugate gradient method ⋮ A new modified three-term conjugate gradient method with sufficient descent property and its global convergence ⋮ A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions ⋮ A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem ⋮ An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization ⋮ A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence ⋮ A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations ⋮ A modified three-term conjugate gradient method with sufficient descent property ⋮ A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods ⋮ A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization ⋮ On three-term conjugate gradient algorithms for unconstrained optimization ⋮ A new three-term conjugate gradient algorithm for unconstrained optimization ⋮ Spectral three-term constrained conjugate gradient algorithm for function minimizations ⋮ 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 new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update ⋮ A descent hybrid modification of the Polak–Ribière–Polyak conjugate gradient method ⋮ Global convergence of a modified spectral three-term CG algorithm for nonconvex unconstrained optimization problems ⋮ Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations

Uses Software

• SCALCG

Cites Work

• Unnamed Item
• On restart procedures for the conjugate gradient method
• On the limited memory BFGS method for large scale optimization
• Efficient generalized conjugate gradient algorithms. I: Theory
• Acceleration of conjugate gradient algorithms for unconstrained optimization
• A conjugate direction algorithm without line searches
• Scaled conjugate gradient algorithms for unconstrained optimization
• An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
• Restart procedures for the conjugate gradient method
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• Function minimization by conjugate gradients
• Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
• The conjugate gradient method in extremal problems
• New conjugacy conditions and related nonlinear conjugate gradient methods