A new hybrid quasi-Newton search direction ( ) is proposed. It uses the update formula of Broyden–Fletcher–Goldfarb–Shanno (BFGS) with a certain conjugate gradient (CG) parameter by a nested direction. The global convergence analysis and superlinear rate, addtionaly with sufficient descent are proved using exact line search. Finally, the computation comparisons are made with original hybrid parents; BFGS and CG, through the efficiency in terms of iteration numbers and CPU-running time showing the superior of . Therefore, the results marked preference of from other two producer algorithms
In this thesis, we are mainly concerned with finding the numerical solution of nonlinear unconstrain...
AbstractQuasi-Newton method is a well-known effective method for solving optimization problems. Sinc...
In this paper, a new search direction vectors are defined for BFGS-CG proposed by Ibrahim et al. by ...
In this work we propose and analyze a hybrid conjugate gradient (CG) method in which the parameter β...
In this paper we present a new line search method known as the HBFGS method, which uses the search d...
In this paper we present a new line search method known as the HBFGS method, which uses the search d...
In this paper we present a new search direction known as the CG-BFGS method, which uses the search d...
In solving large scale problems, the quasi-Newton method is known as the most efficient method in so...
AbstractConjugate gradient methods are conjugate direction or gradient deflection methods which lie ...
In this study, we tend to propose a replacement hybrid algorithmic rule which mixes the search direc...
AbstractConjugate gradient methods are conjugate direction or gradient deflection methods which lie ...
Among the quasi-Newton algorithms, the BFGS method is often discussed by related scholars. However, ...
Two modified methods for unconstrained optimization are presented. The methods employ a hybrid desce...
This note focuses on developing quasi-Newton methods that combine m+ 1 multistep and single-step upd...
This note focuses on developing quasi-Newton methods that combine m+ 1 multistep and single-step upd...
In this thesis, we are mainly concerned with finding the numerical solution of nonlinear unconstrain...
AbstractQuasi-Newton method is a well-known effective method for solving optimization problems. Sinc...
In this paper, a new search direction vectors are defined for BFGS-CG proposed by Ibrahim et al. by ...
In this work we propose and analyze a hybrid conjugate gradient (CG) method in which the parameter β...
In this paper we present a new line search method known as the HBFGS method, which uses the search d...
In this paper we present a new line search method known as the HBFGS method, which uses the search d...
In this paper we present a new search direction known as the CG-BFGS method, which uses the search d...
In solving large scale problems, the quasi-Newton method is known as the most efficient method in so...
AbstractConjugate gradient methods are conjugate direction or gradient deflection methods which lie ...
In this study, we tend to propose a replacement hybrid algorithmic rule which mixes the search direc...
AbstractConjugate gradient methods are conjugate direction or gradient deflection methods which lie ...
Among the quasi-Newton algorithms, the BFGS method is often discussed by related scholars. However, ...
Two modified methods for unconstrained optimization are presented. The methods employ a hybrid desce...
This note focuses on developing quasi-Newton methods that combine m+ 1 multistep and single-step upd...
This note focuses on developing quasi-Newton methods that combine m+ 1 multistep and single-step upd...
In this thesis, we are mainly concerned with finding the numerical solution of nonlinear unconstrain...
AbstractQuasi-Newton method is a well-known effective method for solving optimization problems. Sinc...
In this paper, a new search direction vectors are defined for BFGS-CG proposed by Ibrahim et al. by ...