Inexact Newton methods are formulated that incorporate features designed to improve convergence from arbitrary starting points. For each method, a basic global convergence result is established to the effect that, under reasonable assumption, if a sequence of iterates has a limit point at which \(F'\) is invertible, then that limit point is a solution and a sequence converges to it.