A three-term conjugate gradient method with nonmonotone line search for unconstrained optimization
From MaRDI portal
Recommendations
- A new three-term conjugate gradient algorithm for unconstrained optimization
- Some three-term conjugate gradient methods for solving unconstrained optimization problems
- An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints
- On three-term conjugate gradient algorithms for unconstrained optimization
- A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
- A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems
- An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems
- Solving Unconstrained Optimization Problems with Some Three-term Conjugate Gradient Methods
- An efficient three-term conjugate gradient-type algorithm for monotone nonlinear equations
- A simple three-term conjugate gradient algorithm for unconstrained optimization
Cited in
(4)- An efficient three-term conjugate gradient-based algorithm involving spectral quotient for solving convex constrained monotone nonlinear equations with applications
- A three-parameter family of nonlinear conjugate gradient methods
- Global convergence of line search (LS) conjugate gradient algorithm with nonmonotone technique
- Some three-term conjugate gradient methods with the inexact line search condition
This page was built for publication: A three-term conjugate gradient method with nonmonotone line search for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2826251)
