A modified three-term conjugate gradient method with sufficient descent property
From MaRDI portal
Recommendations
- A three-term conjugate gradient method with sufficient descent property
- An extended three-term conjugate gradient method with sufficient descent property
- Two modified three-term conjugate gradient methods with sufficient descent property
- Some descent three-term conjugate gradient methods and their global convergence
- A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization
Cites work
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Two-Term PRP-Based Descent Method
- A conjugate gradient method with descent direction for unconstrained optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A modified Hestenes-Stiefel conjugate gradient algorithm for large-scale optimization
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization
- A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
- A survey of nonlinear conjugate gradient methods
- Algorithm 851
- An eigenvalue study on the sufficient descent property of a modified Polak-Ribière-Polyak conjugate gradient method
- Benchmarking optimization software with performance profiles.
- CUTEr and SifDec
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
- Mathematical theory of optimization
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Optimization theory and methods. Nonlinear programming
- The conjugate gradient method in extremal problems
- Two modified Polak-Ribière-Polyak-type nonlinear conjugate methods with sufficient descent property
Cited in
(13)- An extended three-term conjugate gradient method with sufficient descent property
- A new three terms gradient descent algorithm
- scientific article; zbMATH DE number 7014239 (Why is no real title available?)
- Comments on ``A hybrid conjugate gradient method based on a quadratic relaxation of the Dai-Yuan hybrid conjugate gradient parameter
- A hybrid conjugate gradient method with sufficient descent property
- A family of the modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent and conjugacy conditions
- A modified THREECG conjugate gradient method with sufficient descent condition and adaptive conjugacy condition
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- A modified three terms HS conjugate gradient method with a new line search
- Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition
- A conjugate gradient method with sufficient descent property
- Two modified three-term conjugate gradient methods with sufficient descent property
- A descent hybrid modification of the Polak-Ribière-Polyak conjugate gradient method
This page was built for publication: A modified three-term conjugate gradient method with sufficient descent property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q530722)
