ON STEEPEST DESCENT ALGORITHMS FOR DISCRETE CONVEX FUNCTIONS.

This paper investigates the complexity of steepest descent algorithms for two classes of discrete convex functions: M-convex functions and L-convex functions. Simple tie-breaking rules yield complexity bounds that are polynomials in the dimension of the variables and the size of the effective domain. Combining the present results with a standard scaling approach leads to an efficient algorithm for L-convex function minimization. [ABSTRACT FROM AUTHOR]