On error bounds for successive approximation methods
Dimitri P. Bertsekas · IEEE Transactions on Automatic Control · 1976
This note considers a class of contraction mappings and the successive approximation method for obtaining the associated fixed points. Some error bounds are provided which generalize and strengthen those given by McQueen [1] and Denardo [2] for dynamic programming algorithms.