Abstract
AbstractIntegrally 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.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Engineering
Reference69 articles.
1. Bauschke, H.H., Combettes, P.L.: Convex analysis and monotone operator theory in Hilbert spaces. Springer, New York (2011)
2. Borwein, J.M., Lewis, A.S.: Convex analysis and nonlinear optimization: theory and examples, 2nd edn. Springer, New York (2006)
3. Brändén, P., Huh, J.: Lorentzian polynomials. Ann. Math. 192, 821–891 (2020)
4. Chen, X., Li, M.: M$$^{\natural }$$-convexity and its applications in operations. Oper. Res. 69, 1396–1408 (2021)
5. Chen, X., Li, M.: Discrete convex analysis and its applications in operations: A survey. Manage. Sci. 30, 1904–1926 (2021)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献