… 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. … In this section we show some examples of L ♮ -convex
functions arising from applications. We also point out that the minimization algorithms used
in those applications can be regarded as special cases of the steepest descent algorithms
for L ♮ -convex functions. …