Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search

DOI10.1016/j.amc.2009.09.063zbMath1185.65100OpenAlexW2015768774MaRDI QIDQ1049322

Lutai Guan, Gaohang Yu, Zeng-xin Wei

Publication date: 8 January 2010

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

Full work available at URL: https://doi.org/10.1016/j.amc.2009.09.063

zbMATH Keywords

global convergencenumerical experimentscomputational efficiencyWolfe line searchlarge-scale problemsPolak-Ribiere-Polyak conjugate gradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Complexity and performance of numerical algorithms (65Y20)

Related Items (15)

A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems ⋮ Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization ⋮ An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems ⋮ A Mathematical and Computational Proposal for the Development of Tight-Binding Order-N Density Matrix Methodology ⋮ Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions ⋮ Global convergence of a modified spectral conjugate gradient method ⋮ Globally convergent modified Perry's conjugate gradient method ⋮ A nonlinear conjugate gradient method for a special class of matrix optimization problems ⋮ Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems ⋮ The hybrid BFGS-CG method in solving unconstrained optimization problems ⋮ A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems ⋮ A practical PR+ conjugate gradient method only using gradient ⋮ Unnamed Item ⋮ Nonlinear conjugate gradient methods for continuous-time output feedback design ⋮ The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A descent nonlinear conjugate gradient method for large-scale unconstrained optimization
• Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
• Efficient hybrid conjugate gradient techniques
• Global convergence result for conjugate gradient methods
• A globally convergent version of the Polak-Ribière conjugate gradient method
• Conjugate gradient methods with Armijo-type line searches.
• Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Testing Unconstrained Optimization Software
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Function minimization by conjugate gradients
• 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: Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search