Contents V.7, N.1, 2016

  • ABOUT THE STEEPNESS OF THE FUNCTION OF DISCRETE ARGUMENT
    V.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.

    Contact Details

    Telephone:
    Email: twms.aliev@gmail.com
    Website: www.twmsj.az

    Z.Khalilov str., 23, AZ 1148,
    Baku
    AZERBAIJAN