Exact bounds for steepest descent algorithms of L-convex function minimization

We analyze minimization algorithms for L♮-convex functions in discrete convex analysis and establish exact bounds for the number of iterations required by the steepest descent algorithm and its variants.