In this work, we present a new hybrid conjugate gradient method based on the approach of
the convex hybridization of the conjugate gradient update parameters of DY and HS+ …

Improving the efficiency of solving complex optimization problems is the focus of intelligent
algorithm research in recent years. Complex optimization problems have the characteristics …

Population-based global optimization algorithms often need few computational costs to find
good regions which contain potential optima, while much more are needed to refine them for …

Simplex gradients are an essential feature of many derivative free optimization algorithms,
and can be employed, for example, as part of the process of defining a direction of search, or …

This work investigates finite differences and the use of interpolation models to obtain
approximations to the first and second derivatives of a function. Here, it is shown that if a …

This paper proposes a direct search frame-based adaptive Barzilai-Borwein method for
unconstrained minimization. The method is based on the framework of frame-based …