The conjugate gradient method provides a very powerful tool for solving unconstrained optimization problems. In this paper the non-linear conjugate gradient methods are tested using some benchmark non-polynomial unconstrained optimization functions. The task was accomplished by finding the exact values of the descent also known as the minimizing argument or rather the minimizer in each method. Findings also show that the basic requirement for exact convergence was satisfied by all the methods
Conjugate Gradient (CG) method is one of the popular methods that solve the large- scale unconstrain...
A direct search algorithm for unconstrained minimization of smooth functions is described. The alg...
Conjugate gradient (CG) methods have been widely used as schemes to solve large-scale unconstrained ...
AbstractIn this paper we develop a new class of conjugate gradient methods for unconstrained optimiz...
One of the open problems known to researchers on the application of nonlinear conjugate gradient met...
Conjugate gradient methods are effective in solving linear equations and solving non-linear optimiza...
The nonlinear conjugate gradient (CG) method is essential in solving large-scale unconstrained optim...
Conjugate Gradient (CG) methods are widely used for solving unconstrained optimization problems. The...
AbstractIn this paper, a new gradient-related algorithm for solving large-scale unconstrained optimi...
AbstractIn this paper, we propose two new hybrid nonlinear conjugate gradient methods, which produce...
AbstractA modified conjugate gradient method is presented for solving unconstrained optimization pro...
: It is proved that the new conjugate gradient method proposed by Dai and Yuan [5] produces a descen...
In this paper, it is aimed to computationally conduct a performance benchmarking for the steepest de...
AbstractFollowing the approach proposed by Dai and Liao, we introduce two nonlinear conjugate gradie...
In this paper , we suggested a new conjugate gradient algorithm for unconstrained optimization based...
Conjugate Gradient (CG) method is one of the popular methods that solve the large- scale unconstrain...
A direct search algorithm for unconstrained minimization of smooth functions is described. The alg...
Conjugate gradient (CG) methods have been widely used as schemes to solve large-scale unconstrained ...
AbstractIn this paper we develop a new class of conjugate gradient methods for unconstrained optimiz...
One of the open problems known to researchers on the application of nonlinear conjugate gradient met...
Conjugate gradient methods are effective in solving linear equations and solving non-linear optimiza...
The nonlinear conjugate gradient (CG) method is essential in solving large-scale unconstrained optim...
Conjugate Gradient (CG) methods are widely used for solving unconstrained optimization problems. The...
AbstractIn this paper, a new gradient-related algorithm for solving large-scale unconstrained optimi...
AbstractIn this paper, we propose two new hybrid nonlinear conjugate gradient methods, which produce...
AbstractA modified conjugate gradient method is presented for solving unconstrained optimization pro...
: It is proved that the new conjugate gradient method proposed by Dai and Yuan [5] produces a descen...
In this paper, it is aimed to computationally conduct a performance benchmarking for the steepest de...
AbstractFollowing the approach proposed by Dai and Liao, we introduce two nonlinear conjugate gradie...
In this paper , we suggested a new conjugate gradient algorithm for unconstrained optimization based...
Conjugate Gradient (CG) method is one of the popular methods that solve the large- scale unconstrain...
A direct search algorithm for unconstrained minimization of smooth functions is described. The alg...
Conjugate gradient (CG) methods have been widely used as schemes to solve large-scale unconstrained ...