A improved spectral hybrid conjugate gradient method for unconstrained optimization
From MaRDI portal
Cites work
- A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations
- A hybrid conjugate gradient algorithm for nonconvex functions and its applications in image restoration problems
- A new hybrid conjugate gradient algorithm based on the Newton direction to solve unconstrained optimization problems
- A structured Fletcher-Revees spectral conjugate gradient method for unconstrained optimization with application in robotic model
- Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions
- An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems
- An unconstrained optimization test functions collection
- Convergence Conditions for Ascent Methods
- Efficient generalized conjugate gradient algorithms. I: Theory
- Function minimization by conjugate gradients
- Global convergence of a modified spectral three-term CG algorithm for nonconvex unconstrained optimization problems
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- The conjugate gradient method in extremal problems
- The new spectral conjugate gradient method for large-scale unconstrained optimisation
This page was built for publication: A improved spectral hybrid conjugate gradient method for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7257089)