Recent progress on integrally convex functions
From MaRDI portal
Publication:6072365
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.
Cites work
- b-matching degree-sequence polyhedra
- M^-convexity and its applications in operations
- A discrete convex min-max formula for box-TDI polyhedra
- A duality principle for non-convex optimisation and the calculus of variations
- A Fenchel-Rockafellar type duality theorem for maximization
- A framework of discrete DC programming by discrete convex analysis
- A study on the demand and response correspondences in the presence of indivisibilities
- A survey of fundamental operations on discrete convex functions of various kinds
- ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS
- Bisubmodular polyhedra, simplicial divisions, and discrete convexity
- Box-total dual integrality, box-integrality, and equimodular matrices
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex analysis and nonlinear optimization. Theory and examples.
- Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
- Directed discrete midpoint convexity
- Directed submodularity, ditroids and directed submodular flows
- Discrete 2-convex functions
- Discrete convex analysis
- Discrete Convex Analysis
- Discrete Fenchel duality for a pair of integrally convex and separable convex functions
- Discrete fixed point analysis and its applications
- Discrete fixed point theorem reconsidered
- Discrete midpoint convexity
- Discrete modeling of economic equilibrium problems
- Existence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concave
- Extremal Splittings of Point Processes
- Greedy systems of linear inequalities and lexicographically optimal solutions
- Gross substitutability: an algorithmic survey
- GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 3885657 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 1953186 (Why is no real title available?)
- scientific article; zbMATH DE number 1789203 (Why is no real title available?)
- scientific article; zbMATH DE number 757676 (Why is no real title available?)
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- Integrality of subgradients and biconjugates of integrally convex functions
- Linear Algebra II
- Lorentzian polynomials
- Note on Multimodularity and L-Convexity
- Note on the polyhedral description of the Minkowski sum of two L-convex sets
- On basic operations related to network induction of discrete convex functions
- On box totally dual integral polyhedra
- On fundamental operations for multimodular functions
- On the solutions of discrete nonlinear complementarity and related problems
- Operations that preserve total dual integrality
- Projection and convolution operations for integrally convex functions
- Proximity theorems of discrete convex functions
- Recent developments in discrete convex analysis
- Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.
- Scaling, proximity, and optimization of integrally convex functions
- Solving discrete systems of nonlinear equations
- Submodular functions and optimization.
- The logic of logistics. Theory, algorithms, and applications for logistics management
- Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions
Cited in
(3)
This page was built for publication: Recent progress on integrally convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6072365)
