A modified Hestenes-Stiefel conjugate gradient algorithm for large-scale optimization
From MaRDI portal
Recommendations
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- A conjugate gradient algorithm under Yuan-Wei-Lu line search technique for large-scale minimization optimization models
- A modified nonmonotone hestenes-Stiefel type conjugate gradient methods for large-scale unconstrained problems
- A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization
- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization
Cites work
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- A conjugate gradient method for unconstrained optimization problems
- 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 BFGS method and its global convergence in nonconvex minimization
- A modified PRP conjugate gradient method
- Algorithm 851
- Benchmarking optimization software with performance profiles.
- CUTE
- Convergence Properties of the BFGS Algoritm
- Convergence analysis of a modified BFGS method on convex minimizations
- Function minimization by conjugate gradients
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:
- Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
- Methods of conjugate gradients for solving linear systems
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- New quasi-Newton methods for unconstrained optimization problems
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- The convergence properties of some new conjugate gradient methods
- The superlinear convergence of a modified BFGS-type method for unconstrained optimization
Cited in
(15)- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- A modified three-term conjugate gradient method with sufficient descent property
- Two modified conjugate gradient methods for unconstrained optimization with applications in image restoration problems
- A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
- A new adaptive trust region algorithm for optimization problems
- A modified conjugate gradient algorithm with backtracking line search technique for large-scale nonlinear equations
- A descent hybridization of the Polak–Ribière–Polyak and Fletcher–Reeves conjugate gradient methods with applications to nonnegative matrix factorization and compressive sensing
- The Hager-Zhang conjugate gradient algorithm for large-scale nonlinear equations
- Behavior of the combination of PRP and HZ methods for unconstrained optimization
- A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition
- A quasi-Newton algorithm for large-scale nonlinear equations
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- Wei-Yao-Liu conjugate gradient projection algorithm for nonlinear monotone equations with convex constraints
- A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations
- A modified three-term PRP conjugate gradient algorithm for optimization models
This page was built for publication: A modified Hestenes-Stiefel conjugate gradient algorithm for large-scale optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2854330)
