ABOUT THE STEEPNESS OF THE FUNCTION OF DISCRETE ARGUMENTV.A.EMELICHEV , A.B.RAMAZANOV (pp. 105-111)
Abstract.We introduce the notion of steepness of a coordinate-convex function of discrete argument on an ordinal-convex set. In terms of guaranteed estimates it is shown that in problems of optimization of coordinate-convex functions on an ordinal-convex set the gradient coordinatewise lifting algorithm is stable under small disturbances of the steepness of the utility function.
Keywords: steepness, gradient, algorithm, stability, discrete.