What is the sufficient global/local convergence condition of inverse quadratic interpolation?

Given a root-finding function f(x)=0, what is the sufficient global/local convergence condition of inverse quadratic interpolation?

-
I'm far away from my library to check, but IIRC this was discussed in Traub's Iterative Methods for the Solution of Equations. Maybe you can take a look? (The thing I do remember is that the global convergence is not too good, which is why in Brent's polyalgorithm, it is only used when the secant method has already picked up some steam.) –  Ｊ. Ｍ. Apr 27 '12 at 13:58
"Iterative Methods for the Solution of Equations" is published in 1982. I have difficulty in finding such an old book. Is there any similiar book or paper? –  Bill Locke Apr 27 '12 at 14:53

In Brent's original 1971 paper that had introduced this method, also in his book Algorithms for Minimization without Derivatives, he mentioned the local convergence condition is that $f$ has a Lipschitz continuous derivative near the root we would like to find.