Conjugate gradient methods (CG) have an important part in unconstrained
optimizations. Numerous studies and modifications have been concerned to improve
these methods. In this study, two modifications of the CG coefficient (Bk) are
proposed in a way to solve unconstrained optimization problems using exact line
searches and inexact line searches by employing strong Wolfe line search.
