Title of article :
ABOUT THE STEEPNESS OF THE FUNCTION OF DISCRETE ARGUMENT
Author/Authors :
EMELICHEV, V.A. Belarusian State University - Department of Mathematical Cybernetics, Belarusia , RAMAZANOV, A.B. Baku State University - Department of Mathematical Cybernetics, Azerbaijan
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 coordinate- wise lifting algorithm is stable under small disturbances of the steepness of the utility function.
Keywords :
steepness , gradient , algorithm , stability , discrete
Journal title :
TWMS Journal of Pure and Applied Mathematics
Journal title :
TWMS Journal of Pure and Applied Mathematics
