This　paper　investigates　a　class　of　methods　for　unconstrained　minimization　which　is　controlled　by　the　Fletcher-Reeves　conjugate　gradient　method.　In　a　simple　way,　we　prove　that　a　kind　of　inexact　line　search　conditions　can　ensure　the　descent　property　and　the　convergence　of　this　class　of　methods.　The　result　is　a　further　extension　of　the　conclusion　given　by　Gilbert　and　Nocedal.