A Combined Cubic and Novel Line Search CG-Algorithm

Abstract

In this paper a new line search technique is investigated. It uses (cubic and novel) line searches in the standard CG-algorithm for unconstrained optimization. Applying our new modified version on CG-method shows that, it is too effective when compared with other established algorithms, in this paper, to solve standard unconstrained optimization problems.

Keywords

• cg-algorithms
• step length
• quadratic function