A three-parameter family of nonlinear conjugate gradient methods
From MaRDI portal
Publication:2719070
DOI10.1090/S0025-5718-00-01253-9zbMath1030.90141OpenAlexW1994725754MaRDI QIDQ2719070
Publication date: 14 May 2001
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-00-01253-9
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52)
Related Items
On Hager and Zhang's conjugate gradient method with guaranteed descent ⋮ An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems ⋮ Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing ⋮ A family of hybrid conjugate gradient methods for unconstrained optimization ⋮ New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems ⋮ The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search ⋮ A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization ⋮ Unnamed Item ⋮ Strong global convergence of an adaptive nonmonotone memory gradient method ⋮ Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search ⋮ New conjugacy condition and related new conjugate gradient methods for unconstrained optimization ⋮ Two modified HS type conjugate gradient methods for unconstrained optimization problems ⋮ Levenberg-Marquardt multi-classification using hinge loss function ⋮ New conjugate gradient method for unconstrained optimization ⋮ \(n\)-step quadratic convergence of the MPRP method with a restart strategy ⋮ GLOBAL CONVERGENCE OF A SPECIAL CASE OF THE DAI–YUAN FAMILY WITHOUT LINE SEARCH ⋮ Convergence of conjugate gradient methods with a closed-form stepsize formula ⋮ A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence ⋮ Further studies on the Wei-Yao-Liu nonlinear conjugate gradient method ⋮ Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method ⋮ Memory gradient method with Goldstein line search ⋮ Global convergence of a two-parameter family of conjugate gradient methods without line search ⋮ Some nonlinear conjugate gradient methods based on spectral scaling secant equations ⋮ A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization ⋮ A note about WYL's conjugate gradient method and its applications ⋮ A conjugate gradient method with descent direction for unconstrained optimization ⋮ A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems ⋮ A conjugate gradient method with sufficient descent property ⋮ The new spectral conjugate gradient method for large-scale unconstrained optimisation ⋮ A truncated descent HS conjugate gradient method and its global convergence ⋮ An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation ⋮ Two spectral conjugate gradient methods for unconstrained optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of globally convergent conjugate gradient methods
- Efficient generalized conjugate gradient algorithms. I: Theory
- Efficient hybrid conjugate gradient techniques
- Global convergence result for conjugate gradient methods
- Generalized Polak-Ribière algorithm
- A globally convergent version of the Polak-Ribière conjugate gradient method
- Advances in nonlinear programming. Proceedings of the 96 international conference. Beijing, China, September 2--5, 1996
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- Conjugate Gradient Methods less Dependent on Conjugacy
- QN-like variable storage conjugate gradients
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Restart procedures for the conjugate gradient method
- Conjugate Gradient Methods with Inexact Searches
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- Convergence properties of the Fletcher-Reeves method
- Function minimization by conjugate gradients
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
- Methods of conjugate gradients for solving linear systems
