In this paper, we discuss the convergence of the Broyden algorithms with revised search direction. Under some inexact line searches, we prove that the algorithms are globally convergent for continuously differentiable functions and the rate of convergence of the algorithms is one-step superlinear and n-step second-order for uniformly convex objective functions.