Search

Given a convex objective function on a Banach space, which is Lipschitz on bounded sets, we consider the class of regular vector fields introduced in our previous work on descent methods. We analyze the behaviour of the values of the objective function for two iterative processes generated by a regular vector field in the presence of computational errors and show that if the computational errors tend to zero, then the values of the objective function converge to its infimum. [ABSTRACT FROM AUTHOR]

Given a Lipschitz convex and coercive objective function on a Banach space, we revisit the class of regular vector fields introduced in our previous work on descent methods. Taking into account computational errors, we study the behaviour of the values of the objective function for the process generated by a regular vector field and show that if the computational errors are small enough, then the values of the objective function become close to its infimum. [ABSTRACT FROM AUTHOR]