An Efficient Mixed Conjugate Gradient Method for Solving Unconstrained Optimisation Problems

Abstract

Conjugate gradient algorithms are most commonly used to solve large scale unconstrained optimisation problems. They are simple and do not require the computation and/or storage of the second derivative information about the objective function. We propose a new conjugate gradient method and establish its global convergence under suitable assumptions. Numerical examples demonstrate the efficiency and effectiveness of our method.