Article ID Journal Published Year Pages File Type
10523946 Operations Research Letters 2014 6 Pages PDF
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Exact bounds for steepest descent algorithms of L-convex function minimization
Authors
, ,