Convergence of PRP method with new nonmonotone line search

DOI10.1016/j.amc.2005.12.064zbMath1155.65352OpenAlexW2035394906MaRDI QIDQ945382

Jie Shen, Zhen-Jun Shi

Publication date: 12 September 2008

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

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

zbMATH Keywords

unconstrained optimizationglobal convergencePRP conjugate gradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Related Items

A nonmonotone line search slackness technique for unconstrained optimization ⋮ New step lengths in conjugate gradient methods ⋮ Unnamed Item ⋮ Globally convergent modified Perry's conjugate gradient method ⋮ A practical PR+ conjugate gradient method only using gradient ⋮ A note on convergence of PRP method with new nonmonotone line search ⋮ Modified differential transform method for solving the model of pollution for a system of lakes

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global convergence of nonmonotone descent methods for unconstrained optimization problems
• A globally convergent version of the Polak-Ribière conjugate gradient method
• Convergence of line search methods for unconstrained optimization
• 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
• On the Convergence of a New Conjugate Gradient Algorithm
• Numerical Optimization
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• 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