Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems

DOI10.1090/S0025-5718-08-02031-0zbMath1198.65091WikidataQ59241589 ScholiaQ59241589MaRDI QIDQ3055065

Guoyin Li, Liqun Qi, Zeng-xin Wei

Publication date: 7 November 2010

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

global convergencenonconvex optimizationinexact line searchPRP method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical computation of solutions to systems of equations (65H10)

Related Items (30)

The Hager–Zhang conjugate gradient algorithm for large-scale nonlinear equations ⋮ A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem ⋮ A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems ⋮ A new version of the Liu-Storey conjugate gradient method ⋮ A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization ⋮ Convergence properties of a class of nonlinear conjugate gradient methods ⋮ A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization ⋮ An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems ⋮ A self-adjusting spectral conjugate gradient method for large-scale unconstrained optimization ⋮ Global convergence of a nonlinear conjugate gradient method ⋮ Global convergence of a modified spectral conjugate gradient method ⋮ Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems ⋮ A modified conjugacy condition and related nonlinear conjugate gradient method ⋮ A hybrid of DL and WYL nonlinear conjugate gradient methods ⋮ A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems ⋮ A modified three-term PRP conjugate gradient algorithm for optimization models ⋮ A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs ⋮ Some global convergence properties of the Wei-Yao-Liu conjugate gradient method with inexact line search ⋮ A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem ⋮ Unnamed Item ⋮ A nonmonotone supermemory gradient algorithm for unconstrained optimization ⋮ A Trust Region Algorithm with Conjugate Gradient Technique for Optimization Problems ⋮ Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization ⋮ An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation ⋮ Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search ⋮ A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization ⋮ A hybrid conjugate gradient method with descent property for unconstrained optimization ⋮ Three modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property ⋮ A NEW DERIVATIVE-FREE CONJUGATE GRADIENT METHOD FOR LARGE-SCALE NONLINEAR SYSTEMS OF EQUATIONS ⋮ A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations

Uses Software

• minpack

Cites Work

• Global convergence of a two-parameter family of conjugate gradient methods without line search
• Efficient generalized conjugate gradient algorithms. I: Theory
• A globally convergent version of the Polak-Ribière conjugate gradient method
• An SQP-type method and its application in stochastic programs
• Minimization of functions having Lipschitz continuous first partial derivatives
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• 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
• A modification of Armijo's step-size rule for negative curvature
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• A Nonmonotone Line Search Technique for Newton’s Method
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• Function minimization by conjugate gradients
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• An efficient hybrid conjugate gradient method for unconstrained optimization
• Global convergence of conjugate gradient methods without line search
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems