Generalizing the Laguerre iteration, which calculates the zeros of a polynomial with real zeros, a quasi-Laguerre iteration is developed. Contrary to the former, it does not require the calculation of the second derivative. It is monotone, globally convergent with convergence rate \(1+\sqrt 2\). Also applications to eigenvalue problems for symmetric tridiagonal matrices are discussed and extensive numerical tests reported.