A new three-term conjugate gradient method with descent direction for unconstrained optimization
From MaRDI portal
Recommendations
- A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
- Some three-term conjugate gradient methods for solving unconstrained optimization problems
- A three-term conjugate gradient method with sufficient descent property
- Some three-term conjugate gradient methods with the new direction structure
- A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization
Cites work
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Two-Term PRP-Based Descent Method
- A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence
- A descent family of Dai-Liao conjugate gradient methods
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
- A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition
- A modified Perry conjugate gradient method and its global convergence
- A new class of spectral conjugate gradient methods based on a modified secant equation for unconstrained optimization
- A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
- A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
- A simple three-term conjugate gradient algorithm for unconstrained optimization
- A survey of nonlinear conjugate gradient methods
- A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
- Benchmarking optimization software with performance profiles.
- CUTE
- Convergence Conditions for Ascent Methods
- Function minimization by conjugate gradients
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction
- On the Convergence of a New Conjugate Gradient Algorithm
- On three-term conjugate gradient algorithms for unconstrained optimization
- Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence
- Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
- The conjugate gradient method in extremal problems
- Two modified hybrid conjugate gradient methods based on a hybrid secant equation
Cited in
(24)- A New Adaptive Subspace Minimization Three-Term Conjugate Gradient Algorithm for Unconstrained Optimization
- A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
- A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
- An improved PRP conjugate gradient algorithm with a damping factor within an automatic restarting strategy
- Descent three-term conjugate gradient methods based on secant conditions for unconstrained optimization
- Comment on ``A new three-term conjugate gradient method for unconstrained problem
- New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction
- A forced descent three-term conjugate gradient method
- A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions
- A new three-term conjugate gradient method
- Global convergence of two kinds of three-term conjugate gradient methods without line search
- A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems
- A modified sufficient descent Polak-Ribiére-Polyak type conjugate gradient method for unconstrained optimization problems
- An efficient adaptive three-term extension of the Hestenes-Stiefel conjugate gradient method
- A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization
- A three-term conjugate gradient method with sufficient descent property
- Some three-term conjugate gradient methods for solving unconstrained optimization problems
- A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization
- Some three-term RMIL conjugate gradient methods with descent property for solving optimization problems with application
- Some new descent nonlinear conjugate gradient methods for unconstrained optimization problems with global convergence
- Some three-term conjugate gradient methods with the new direction structure
- A scaled three-term conjugate gradient method for unconstrained optimization
- A new three-term conjugate gradient algorithm for unconstrained optimization
- New three-term conjugate gradient method with guaranteed global convergence
This page was built for publication: A new three-term conjugate gradient method with descent direction for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5011628)
