New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems

DOI10.1016/j.amc.2005.11.150zbMath1106.65055OpenAlexW2089288074WikidataQ59241595 ScholiaQ59241595MaRDI QIDQ849738

Liqun Qi, Guoyin Li, Zeng-xin Wei

Publication date: 31 October 2006

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

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

zbMATH Keywords

unconstrained optimizationglobal convergencenumerical resultsArmijo line searchlarge scale problemnonlinear conjugate gradient formulasWolfe-Powell conditions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Related Items

Spectral method and its application to the conjugate gradient method ⋮ Sufficient descent nonlinear conjugate gradient methods with conjugacy condition ⋮ A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization ⋮ A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization ⋮ A descent nonlinear conjugate gradient method for large-scale unconstrained optimization ⋮ A new class of nonlinear conjugate gradient coefficients with global convergence properties ⋮ A new modified three-term conjugate gradient method with sufficient descent property and its global convergence ⋮ A truncated three-term conjugate gradient method with complexity guarantees with applications to nonconvex regression problem ⋮ Optimization of unconstrained problems using a developed algorithm of spectral conjugate gradient method calculation ⋮ A hybrid conjugate gradient algorithm for nonconvex functions and its applications in image restoration problems ⋮ A variant spectral-type FR conjugate gradient method and its global convergence ⋮ Globally convergent conjugate gradient algorithms without the Lipschitz condition for nonconvex optimization ⋮ An adaptive projection BFGS method for nonconvex unconstrained optimization problems ⋮ Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property ⋮ A nonlinear conjugate gradient method for a special class of matrix optimization problems ⋮ A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence ⋮ A survey of gradient methods for solving nonlinear optimization ⋮ Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization ⋮ A new method with sufficient descent property for unconstrained optimization ⋮ A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches ⋮ 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 conjugate gradient method for unconstrained optimization problems ⋮ Applying powell's symmetrical technique to conjugate gradient methods ⋮ A modified nonlinear conjugate gradient method with the Armijo line search and its application ⋮ A New Method with Descent Property for Symmetric Nonlinear Equations ⋮ New line search methods for unconstrained optimization ⋮ Spectral modified Polak-Ribiére-Polyak projection conjugate gradient method for solving monotone systems of nonlinear equations ⋮ A conjugate gradient method with descent direction for unconstrained optimization ⋮ Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems ⋮ A Trust Region Algorithm with Conjugate Gradient Technique for Optimization Problems ⋮ Behavior of the combination of PRP and HZ methods for unconstrained optimization ⋮ A modified PRP conjugate gradient method ⋮ An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimisation ⋮ A new class of nonlinear conjugate gradient coefficients for unconstrained optimization

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global convergence of a two-parameter family of conjugate gradient methods without line search
• Efficient generalized conjugate gradient algorithms. I: Theory
• Optimization. Algorithms and consistent approximations
• A globally convergent version of the Polak-Ribière conjugate gradient method
• An SQP-type method and its application in stochastic programs
• Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
• Minimization of functions having Lipschitz continuous first partial derivatives
• A three-parameter family of nonlinear conjugate gradient methods
• Convergence Properties of Algorithms for Nonlinear Optimization
• 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
• Convergence Conditions for Ascent Methods
• Convergence Conditions for Ascent Methods. II: Some Corrections
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• Two fundamental convergence theorems for nonlinear conjugate gradient methods and their applications
• An efficient hybrid conjugate gradient method for unconstrained optimization
• Global convergence of conjugate gradient methods without line search