TWO CONVERGENCE RESULTS FOR A GRADIENT-TYPE METHOD IN BANACH SPACES.

Given a convex objective function on a Banach space which is Lipschitz on bounded sets and satisfies a coercivity growth condition, we prove two convergence results for a gradient-type method, generated by a regular vector field, under the presence of computational errors. We show that if the computational errors are small enough, then the values of the objective function become close to its infimum. [ABSTRACT FROM AUTHOR]