Convergence of Liu-Storey conjugate gradient method
From MaRDI portal
Publication:881512
DOI10.1016/j.ejor.2006.09.066zbMath1121.90125OpenAlexW2064006173MaRDI QIDQ881512
Publication date: 30 May 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.09.066
Related Items (8)
A study of Liu-Storey conjugate gradient methods for vector optimization ⋮ On the extension of the Hager-Zhang conjugate gradient method for vector optimization ⋮ A new descent memory gradient method and its global convergence ⋮ 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 ⋮ Convergence of the descent Dai–Yuan conjugate gradient method for unconstrained optimization ⋮ A hybrid self-adaptive conjugate first order reliability method for robust structural reliability analysis ⋮ Penalty algorithm based on conjugate gradient method for solving portfolio management problem
Cites Work
- Step-size estimation for unconstrained optimization methods
- Global convergence of a two-parameter family of conjugate gradient methods without line search
- Quadratic cost flow and the conjugate gradient method
- Efficient generalized conjugate gradient algorithms. I: Theory
- Global convergence result for conjugate gradient methods
- A globally convergent version of the Polak-Ribière conjugate gradient method
- Minimization of functions having Lipschitz continuous first partial derivatives
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
- Convergence of descent method without line search
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- On the Convergence of a New Conjugate Gradient Algorithm
- Numerical Optimization
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- Convergence properties of the Fletcher-Reeves method
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method
- Function minimization by conjugate gradients
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- New properties of a nonlinear conjugate gradient method
- Global convergence of conjugate gradient methods without line search
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Convergence of Liu-Storey conjugate gradient method
