Pages that link to "Item:Q1321117"
From MaRDI portal
The following pages link to Global convergence result for conjugate gradient methods (Q1321117):
Displayed 35 items.
- Convergence and stability of line search methods for unconstrained optimization (Q385584) (← links)
- A gradient-related algorithm with inexact line searches (Q596214) (← links)
- The convergence of conjugate gradient method with nonmonotone line search (Q606706) (← links)
- Two modified HS type conjugate gradient methods for unconstrained optimization problems (Q611200) (← links)
- Two effective hybrid conjugate gradient algorithms based on modified BFGS updates (Q645035) (← links)
- A conjugate gradient method with descent direction for unconstrained optimization (Q732160) (← links)
- Global convergence properties of the two new dependent Fletcher-Reeves conjugate gradient methods (Q856066) (← links)
- Convergence properties of the dependent PRP conjugate gradient methods (Q863032) (← links)
- A new class of supermemory gradient methods (Q865511) (← links)
- Convergence of Liu-Storey conjugate gradient method (Q881512) (← links)
- A descent nonlinear conjugate gradient method for large-scale unconstrained optimization (Q883860) (← links)
- A conjugate gradient method for unconstrained optimization problems (Q963493) (← links)
- Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization (Q970585) (← links)
- Hybrid conjugate gradient algorithm for unconstrained optimization (Q1028610) (← links)
- Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search (Q1049322) (← links)
- Optimization by pattern search (Q1342017) (← links)
- A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines (Q1919811) (← links)
- A new variant of the memory gradient method for unconstrained optimization (Q1926613) (← links)
- A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods (Q1937015) (← links)
- Further insight into the convergence of the Fletcher-Reeves method (Q1974184) (← links)
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search (Q2433993) (← links)
- Convergence of supermemory gradient method (Q2454990) (← links)
- Memory gradient method with Goldstein line search (Q2469911) (← links)
- Another hybrid conjugate gradient algorithm for unconstrained optimization (Q2481406) (← links)
- A new family of conjugate gradient methods (Q2519734) (← links)
- A three-parameter family of nonlinear conjugate gradient methods (Q2719070) (← links)
- A note on global convergence result for conjugate gradient methods (Q2741563) (← links)
- A hybrid conjugate gradient method based on a quadratic relaxation of the Dai–Yuan hybrid conjugate gradient parameter (Q2868907) (← links)
- A Trust Region Algorithm with Conjugate Gradient Technique for Optimization Problems (Q3083525) (← links)
- GLOBAL CONVERGENCE OF A SPECIAL CASE OF THE DAI–YUAN FAMILY WITHOUT LINE SEARCH (Q3526527) (← links)
- (Q4039213) (← links)
- Efficient implementation of a generalized polak-ribière algorithm for nonlinear optimization (Q4323721) (← links)
- Global convergence of the DY conjugate gradient method with Armijo line search for unconstrained optimization problems (Q5436916) (← links)
- Two fundamental convergence theorems for nonlinear conjugate gradient methods and their applications (Q5931897) (← links)
- Global convergence property of \(s\)-dependent GFR conjugate gradient method (Q5955943) (← links)