Search
نمایش تعداد 1-10 از 36
A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
In order to achieve a theoretically effective and numerically efficient method for solving large-scale unconstrained optimization problems, a hybridization of the Fletcher-Reeves and Polak-Ribière-Polyak conjugate gradient methods is proposed...
A 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 ...
An Optimal–Ribière–Polyak Conjugate Gradient Method
Based on a singular value analysis on an extension of the Polak–Ribière–Polyak method, a nonlinear conjugate gradient method with the following two optimal features is proposed: the condition number of its search direction ...
Two optimal Dai–Liao conjugate gradient methods
Two adaptive choices for the parameter of Dai–Liao conjugate gradient (CG) method are suggested. One of which is obtained by minimizing the distance between search directions of Dai–Liao method and a three-term CG method ...
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 Neural Network Approach for Solving a Class of Fractional Optimal Control Problems
In this paper the perceptron neural networks are applied to approximate the solution
of fractional optimal control problems. The necessary (and also sufficient in most cases)
optimality conditions are stated ...
An Adaptive Hager-Zhang Conjugate Gradient Method
for the uniformly
convex objective functions. Numerical comparisons between the implementations of the proposed method
and the Hager-Zhang method are made on a set of unconstrained optimization test problems of the CUTEr
collection, using...