The study of optimization is getting broader with every passing day. Optimization is basically the art of getting the best results under a given set of circumstances. A very simple but important class of optimization problems is the unconstrained problems. Several techniques have been developed to handle unconstrained problems, one of which is the conjugate gradient method (CGM), which is iterative in nature. In this work, we applied the nonlinear CGM to solve unconstrained problems using inexact line search techniques. We employed the well-known Armijo line search criterion and its modified form
Keywords: Conjugate Gradient Method, Line Search, Step Length, Unconstrained Problems
