A three-parameter family of nonlinear conjugate gradient methods
From MaRDI portal
Recommendations
- A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method
- A new three-term conjugate gradient method
- A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
- Investigation on a nonmonotone conjugate gradient algorithm with three parameters
- A descent family of three-term conjugate gradient methods with global convergence for general functions
- A new two-parameter family of nonlinear conjugate gradient methods
- A three-term conjugate gradient method with nonmonotone line search for unconstrained optimization
- A three-term conjugate gradient algorithm for large-scale nonsmooth minimizations
- Least-squares-based three-term conjugate gradient methods
- A family of nonlinear conjugate gradient methods with a global convergence property
Cites work
- A class of globally convergent conjugate gradient methods
- 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
- Conjugate Gradient Methods less Dependent on Conjugacy
- Conjugate Gradient Methods with Inexact Searches
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- Convergence properties of the Fletcher-Reeves method
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Efficient generalized conjugate gradient algorithms. I: Theory
- Efficient hybrid conjugate gradient techniques
- Function minimization by conjugate gradients
- Generalized Polak-Ribière algorithm
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global convergence result for conjugate gradient methods
- scientific article; zbMATH DE number 3843083 (Why is no real title available?)
- scientific article; zbMATH DE number 1186897 (Why is no real title available?)
- scientific article; zbMATH DE number 3687182 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- scientific article; zbMATH DE number 3304573 (Why is no real title available?)
- Methods of conjugate gradients for solving linear systems
- QN-like variable storage conjugate gradients
- Restart procedures for the conjugate gradient method
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
Cited in
(37)- A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
- A truncated descent HS conjugate gradient method and its global convergence
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
- A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method
- A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization
- Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search
- A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence
- Convergence of conjugate gradient methods with a closed-form stepsize formula
- Some nonlinear conjugate gradient methods based on spectral scaling secant equations
- The new spectral conjugate gradient method for large-scale unconstrained optimisation
- Two spectral conjugate gradient methods for unconstrained optimization problems
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
- A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
- The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search
- Further studies on the Wei-Yao-Liu nonlinear conjugate gradient method
- Memory gradient method with Goldstein line search
- A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
- On Hager and Zhang's conjugate gradient method with guaranteed descent
- New conjugate gradient method for unconstrained optimization
- An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems
- GLOBAL CONVERGENCE OF A SPECIAL CASE OF THE DAI–YUAN FAMILY WITHOUT LINE SEARCH
- A family of hybrid conjugate gradient methods for unconstrained optimization
- Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method
- Convergence of a two-parameter family of conjugate gradient methods with a fixed formula of stepsize
- A new two-parameter family of nonlinear conjugate gradient methods
- A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization
- Levenberg-Marquardt multi-classification using hinge loss function
- Two modified HS type conjugate gradient methods for unconstrained optimization problems
- \(n\)-step quadratic convergence of the MPRP method with a restart strategy
- Two efficient nonlinear conjugate gradient methods for Riemannian manifolds
- Global convergence of a two-parameter family of conjugate gradient methods without line search
- A conjugate gradient method with descent direction for unconstrained optimization
- A conjugate gradient method with sufficient descent property
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
- Strong global convergence of an adaptive nonmonotone memory gradient method
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- A note about WYL's conjugate gradient method and its applications
This page was built for publication: A three-parameter family of nonlinear conjugate gradient methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2719070)
