Conjugate gradient methods form a class of iterative algorithms that are highly effective for solving large‐scale unconstrained optimisation problems. They achieve efficiency by constructing search ...

This is a preview. Log in through your library . Abstract In the setting of Hilbert spaces, we show that a hybrid steepest-descent algorithm converges strongly to a solution of a convex minimization ...

In this paper we present two algorithms for LC¹ unconstrained optimization problems which use the second order Dini upper directional derivative. These methods are simple and easy to perform. We ...