Pages that link to "Item:Q3700719"
From MaRDI portal
The following pages link to Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search (Q3700719):
Displayed 50 items.
- Global convergence of some modified PRP nonlinear conjugate gradient methods (Q644512) (← links)
- Two effective hybrid conjugate gradient algorithms based on modified BFGS updates (Q645035) (← links)
- A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches (Q668235) (← links)
- Exploiting damped techniques for nonlinear conjugate gradient methods (Q684134) (← links)
- A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique (Q723782) (← links)
- A conjugate gradient method with descent direction for unconstrained optimization (Q732160) (← links)
- Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization (Q737229) (← links)
- A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery (Q827377) (← links)
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems (Q849738) (← links)
- Global convergence properties of the two new dependent Fletcher-Reeves conjugate gradient methods (Q856066) (← links)
- Global convergence of a memory gradient method for unconstrained optimization (Q861515) (← links)
- Convergence properties of the dependent PRP conjugate gradient methods (Q863032) (← links)
- Strong global convergence of an adaptive nonmonotone memory gradient method (Q870222) (← links)
- Efficient rank reduction of correlation matrices (Q875015) (← links)
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization (Q875393) (← links)
- Convergence of Liu-Storey conjugate gradient method (Q881512) (← links)
- A descent nonlinear conjugate gradient method for large-scale unconstrained optimization (Q883860) (← links)
- Efficient generalized conjugate gradient algorithms. I: Theory (Q915657) (← links)
- Global convergence of a modified spectral FR conjugate gradient method (Q942404) (← links)
- Global convergence of a memory gradient method without line search (Q949285) (← links)
- Multi-step nonlinear conjugate gradient methods for unconstrained minimization (Q953210) (← links)
- A conjugate gradient method for unconstrained optimization problems (Q963493) (← links)
- Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems (Q964960) (← links)
- Two new conjugate gradient methods based on modified secant equations (Q972741) (← links)
- A note about WYL's conjugate gradient method and its applications (Q990447) (← links)
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping (Q1016416) (← links)
- A modified PRP conjugate gradient method (Q1026553) (← links)
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization (Q1036299) (← links)
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation (Q1039699) (← links)
- Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search (Q1049322) (← links)
- Efficient hybrid conjugate gradient techniques (Q1117142) (← links)
- Nonlinear CG-like iterative methods (Q1196845) (← links)
- Large sparse continuation problems (Q1263940) (← links)
- A generalized conjugate gradient algorithm (Q1265069) (← links)
- A class of nonmonotone conjugate gradient methods for unconstrained optimization (Q1293956) (← links)
- Global convergence result for conjugate gradient methods (Q1321117) (← links)
- A globally convergent version of the Polak-Ribière conjugate gradient method (Q1366426) (← links)
- Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization (Q1411546) (← links)
- Conjugate gradient methods with Armijo-type line searches. (Q1611089) (← links)
- A descent hybrid conjugate gradient method based on the memoryless BFGS update (Q1625764) (← links)
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition (Q1626534) (← links)
- On the convergence of \(s\)-dependent GFR conjugate gradient method for unconstrained optimization (Q1652787) (← links)
- A Barzilai and Borwein scaling conjugate gradient method for unconstrained optimization problems (Q1663393) (← links)
- An efficient hybrid conjugate gradient method with the strong Wolfe-Powell line search (Q1664598) (← links)
- A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization (Q1665439) (← links)
- Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search (Q1667567) (← links)
- A modified conjugacy condition and related nonlinear conjugate gradient method (Q1718989) (← links)
- A hybrid of DL and WYL nonlinear conjugate gradient methods (Q1723746) (← links)
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search (Q1757395) (← links)
- A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method (Q1825603) (← links)