Recent Progress on Integrally Convex Functions
Preprint
Abstract
Integrally convex functions constitute a fundamental function class in discrete convex analysis, including M-convex functions, L-convex functions, and many others. This paper aims at a rather comprehensive survey of recent results on integrally convex functions with some new technical results. Topics covered in this paper include characterizations of integral convex sets and functions, operations on integral convex sets and functions, optimality criteria for minimization with a proximity-scaling algorithm, integral biconjugacy, and the discrete Fenchel duality. While the theory of M-convex and L-convex functions has been built upon fundamental results on matroids and submodular functions, developing the theory of integrally convex functions requires more general and basic tools such as the Fourier-Motzkin elimination.Keywords
All Related Versions
This publication has 43 references indexed in Scilit:
- Scaling, proximity, and optimization of integrally convex functionsMathematical Programming, 2018
- A framework of discrete DC programming by discrete convex analysisMathematical Programming, 2014
- Proximity theorems of discrete convex functionsMathematical Programming, 2004
- Discrete convex analysisMathematical Programming, 1998
- b-matching degree-sequence polyhedraCombinatorica, 1991
- Directed submodularity, ditroids and directed submodular flowsMathematical Programming, 1988
- On box totally dual integral polyhedraMathematical Programming, 1986
- Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functionsMathematical Programming, 1984
- A duality principle for non-convex optimisation and the calculus of variationsArchive for Rational Mechanics and Analysis, 1979
- Convexity and Optimization in Finite Dimensions I1970