Search
CSV
RISA New Three–Term Conjugate Gradient Method with Descent Direction for Unconstrained Optimization
In this paper, we propose a three{term PRP{type conjugate gradient
method which always satisfies the sufficient descent condition independently of line
searches employed. An important property of our method is that its direction...
A modified scaled conjugate gradient method with global convergence for nonconvex functions
Following Andrei’s approach, a modified scaled memoryless BFGS preconditioned conjugate gradient method is proposed based on the modified secant equation suggested by Li and Fukushima. It is shown that the method is globally ...
A descent family of Dai-Liao conjugate gradient methods
Based on an eigenvalue study, a descent class of Dai–Liao conjugate gradient methods is proposed. An interesting feature of the proposed class is its inclusion of the efficient nonlinear conjugate gradient methods proposed ...
Two modified three-term conjugate gradient methods with sufficient descent property
Based on the insight gained from the three-term conjugate gradient methods suggested by Zhang et al. (Optim Methods Softw 22:697–711,2007) two nonlinear conjugate gradient methods are proposed, making modifications on the ...
A descent extension of the Polak–Ribière–Polyak conjugate gradient method
Based on an eigenvalue analysis, a descent class of two-parameter extension of the conjugate gradient method proposed by Polak and Ribière (1969), and Polyak (1969) is suggested.It is interesting that the one-parameter ...
A descent hybrid modification of the Polak–Ribiere–Polyak conjugate gradient method
the sufficient descent condition independent of the line search and the objective function convexity. Similar to the Polak–Ribière–Polyak method, the method possesses an automatic restart feature which avoids jamming. Global convergence analyses are conducted...
Descent Symmetrization of the Dai–Liao Conjugate Gradient Method
Symmetrizing the Dai–Liao (DL) search direction matrix by a rank-one modification, we propose a one-parameter class of nonlinear conjugate gradient (CG) methods which includes the memoryless Broyden–Fletcher–Goldfarb–Shanno ...
Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination
In this paper, a modified Hestenes–Stiefel conjugate gradient method for unconstrained problems is developed, which can achieves the twin goals of generating sufficient descent direction at each iteration as well as being ...
An Adaptive Three-Term Conjugate Gradient Method with Sufficient Descent Condition and Conjugacy Condition
In this paper, an adaptive three-term conjugate gradient method is proposed for solving unconstrained problems, which generates sufficient descent directions at each iteration. Different from the existent methods, a dynamical ...
An extended three-term conjugate gradient method with sufficient descent property
An extension of the three-term conjugate gradient method proposed by Zhang et al.
is suggested. Based on an eigenvalue analysis on the search direction matrix, it is shown that
the method possesses the ...