Global convergence of the original Liu-Storey conjugate gradient method
نویسندگان
چکیده
منابع مشابه
Global Convergence of a Modified Liu-storey Conjugate Gradient Method
In this paper, we make a modification to the LS conjugate gradient method and propose a descent LS method. The method can generates sufficient descent direction for the objective function. We prove that the method is globally convergent with an Armijo-type line search. Moreover, under mild conditions, we show that the method is globally convergent if the Armijo line search or the Wolfe line sea...
متن کاملSome global convergence properties of the Wei-Yao-Liu conjugate gradient method with inexact line search
In [Z.Wei, S. Yao, L. Liu, The convergence properties of some new conjugate gradient methods, Applied Mathematics and Computation 183 (2006) 1341–1350], Wei et al. proposed a new conjugate gradient method called WYL method which has good numerical experiments and some excellent properties such as b k P 0. In this paper, we prove that while tk 6 1 c 2L kgkk kdkk , the sufficient descent conditio...
متن کاملConvergence of Liu-storey Conjugate Method with Nonmonotone Armijo Line Search
In this paper, we develop a new nonmonotone Armijo-type line search for LS (Liu-Storey) conjugate gradient method for minimizing functions having Lipschitz continuous partial derivatives. The nonmonotone line search can guarantee the global convergence of original LS method under some mild conditions. AMS Subject Classification: 90C30, 65K05
متن کاملGlobal convergence of a modified spectral FR conjugate gradient method
A modified spectral PRP conjugate gradient method is presented for solving unconstrained optimization problems. The constructed search direction is proved to be a sufficiently descent direction of the objective function. With an Armijo-type line search to determinate the step length, a new spectral PRP conjugate algorithm is developed. Under some mild conditions, the theory of global convergenc...
متن کاملA New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies the sufficient descent condition independent of line search method, based on eigenvalue analysis. The globa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ScienceAsia
سال: 2016
ISSN: 1513-1874
DOI: 10.2306/scienceasia1513-1874.2016.42.146