Discrete Convex Analysis II: Local Optimality for Integrally Convex FunctionsTextbook
For a convex function on , a point is a global minimizer as soon as it is a local minimizer — this is one of the earliest and most consequential facts of convex analysis, and it underlies why local-search and gradient methods can certify global optimality in convex programs. The discrete analogue is not automatic: a function on the integer…