A New Hybrid Algorithm for Convex Nonlinear Unconstrained Optimization

الملخص EN

In this study, we tend to propose a replacement hybrid algorithmic rule which mixes the search directions like Steepest Descent (SD) and Quasi-Newton (QN).

First, we tend to develop a replacement search direction for combined conjugate gradient (CG) and QN strategies.

Second, we tend to depict a replacement positive CG methodology that possesses the adequate descent property with sturdy Wolfe line search.

We tend to conjointly prove a replacement theorem to make sure global convergence property is underneath some given conditions.

Our numerical results show that the new algorithmic rule is powerful as compared to different standard high scale CG strategies.