Convergence of Liu-Storey conjugate gradient method
From MaRDI portal
Recommendations
- The convergence of conjugate gradient method with nonmonotone line search
- Convergence of Liu-Storey conjugate method with nonmonotone Armijo line search
- Global convergence of a modified Liu-Storey conjugate gradient method
- A new version of the Liu-Storey conjugate gradient method
- Global convergence of conjugate gradient method
Cites work
- scientific article; zbMATH DE number 1004164 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 6173889 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A globally convergent version of the Polak-Ribière conjugate gradient method
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method
- Convergence of descent method without line search
- Convergence properties of the Fletcher-Reeves method
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Efficient generalized conjugate gradient algorithms. I: Theory
- Function minimization by conjugate gradients
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global convergence of a two-parameter family of conjugate gradient methods without line search
- Global convergence of conjugate gradient methods without line search
- Global convergence result for conjugate gradient methods
- Methods of conjugate gradients for solving linear systems
- Minimization of functions having Lipschitz continuous first partial derivatives
- New properties of a nonlinear conjugate gradient method
- Numerical Optimization
- On the Convergence of a New Conjugate Gradient Algorithm
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
- Quadratic cost flow and the conjugate gradient method
- Step-size estimation for unconstrained optimization methods
- The conjugate gradient method in extremal problems
Cited in
(15)- A hybrid self-adaptive conjugate first order reliability method for robust structural reliability analysis
- Convergence of Liu-Storey conjugate method with nonmonotone Armijo line search
- A study of Liu-Storey conjugate gradient methods for vector optimization
- A new descent memory gradient method and its global convergence
- A sufficient descent Liu–Storey conjugate gradient method and its global convergence
- Convergence of the descent Dai-Yuan conjugate gradient method for unconstrained optimization
- Global convergence of a modified Liu-Storey conjugate gradient method
- The convergence of conjugate gradient method with nonmonotone line search
- Penalty algorithm based on conjugate gradient method for solving portfolio management problem
- \(n\)-step quadratic convergence of a restart Liu-Storey type method
- A new version of the Liu-Storey conjugate gradient method
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- A sufficient descent LS conjugate gradient method for unconstrained optimization problems
- On the strong convergence of a sufficient descent Polak-Ribière-Polyak conjugate gradient method
- A family of limited memory three term conjugate gradient methods
This page was built for publication: Convergence of Liu-Storey conjugate gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q881512)
