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.
- 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)
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch (Q1891684) (← 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)
- The global convergence of a new mixed conjugate gradient method for unconstrained optimization (Q1952993) (← links)
- Further insight into the convergence of the Fletcher-Reeves method (Q1974184) (← links)
- A modified nonlinear conjugate gradient method with the Armijo line search and its application (Q2007123) (← links)
- A modified three-term type CD conjugate gradient algorithm for unconstrained optimization problems (Q2007335) (← links)
- A class of modified FR conjugate gradient method and applications to non-negative matrix factorization (Q2013810) (← links)
- A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods (Q2017614) (← links)
- Riemannian conjugate gradient methods with inverse retraction (Q2023689) (← links)
- Hybrid Riemannian conjugate gradient methods with global convergence properties (Q2023690) (← links)
- An efficient modified AZPRP conjugate gradient method for large-scale unconstrained optimization problem (Q2036061) (← links)
- Sufficient descent Riemannian conjugate gradient methods (Q2046556) (← links)
- Behavior of the combination of PRP and HZ methods for unconstrained optimization (Q2061360) (← links)
- A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration (Q2068018) (← links)
- Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications (Q2068628) (← links)
- Two classes of spectral conjugate gradient methods for unconstrained optimizations (Q2103158) (← links)
- Two efficient modifications of AZPRP conjugate gradient method with sufficient descent property (Q2129100) (← links)
- A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection (Q2133373) (← links)
- A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems (Q2146720) (← links)
- New hybrid conjugate gradient method as a convex combination of LS and FR methods (Q2150719) (← links)
- Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions (Q2163450) (← links)
- Further comment on another hybrid conjugate gradient algorithm for unconstrained optimization by Andrei (Q2181673) (← links)
- The projection technique for two open problems of unconstrained optimization problems (Q2194129) (← links)
- A modified nonlinear Polak-Ribière-Polyak conjugate gradient method with sufficient descent property (Q2201566) (← links)
- Two-step conjugate gradient method for unconstrained optimization (Q2204167) (← links)
- A survey of gradient methods for solving nonlinear optimization (Q2220680) (← links)
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs (Q2252688) (← links)
- An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems (Q2273038) (← links)
- The convergence properties of RMIL+ conjugate gradient method under the strong Wolfe line search (Q2284804) (← links)
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search (Q2290291) (← links)
- A modified spectral conjugate gradient method with global convergence (Q2317848) (← links)
- A hybrid conjugate gradient method with descent property for unconstrained optimization (Q2337555) (← links)
- A nonmonotone hybrid conjugate gradient method for unconstrained optimization (Q2340982) (← links)
- Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization (Q2345746) (← links)
- A scaled three-term conjugate gradient method for unconstrained optimization (Q2374196) (← links)
- The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search (Q2383633) (← links)
- An improved Hoschek intrinsic parametrization (Q2388530) (← links)
- Preconditioned nonlinear conjugate gradient methods based on a modified secant equation (Q2422866) (← links)
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search (Q2433993) (← links)
- On the method of shortest residuals for unconstrained optimization (Q2471088) (← links)