Recent progress on integrally convex functions
From MaRDI portal
Publication:6072365
DOI10.1007/s13160-023-00589-4arXiv2211.10912OpenAlexW4367173627MaRDI QIDQ6072365
Publication date: 13 October 2023
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.10912
minimizationFenchel dualitydiscrete convex analysisintegrally convex functionbox-total dual integralityintegral subgradient
Convex programming (90C25) Combinatorial optimization (90C27) Convexity of real functions of several variables, generalizations (26B25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A framework of discrete DC programming by discrete convex analysis
- Solving discrete systems of nonlinear equations
- Convex analysis and nonlinear optimization. Theory and examples.
- Directed submodularity, ditroids and directed submodular flows
- \(b\)-matching degree-sequence polyhedra
- A duality principle for non-convex optimisation and the calculus of variations
- Discrete convex analysis
- Gross substitutability: an algorithmic survey
- Projection and convolution operations for integrally convex functions
- Operations that preserve total dual integrality
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Proximity theorems of discrete convex functions
- Directed discrete midpoint convexity
- Box-total dual integrality, box-integrality, and equimodular matrices
- Discrete 2-convex functions
- Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
- Note on the polyhedral description of the Minkowski sum of two L-convex sets
- Discrete Fenchel duality for a pair of integrally convex and separable convex functions
- Lorentzian polynomials
- Integrality of subgradients and biconjugates of integrally convex functions
- Bisubmodular polyhedra, simplicial divisions, and discrete convexity
- Scaling, proximity, and optimization of integrally convex functions
- A study on the demand and response correspondences in the presence of indivisibilities
- Discrete fixed point analysis and its applications
- Submodular functions and optimization.
- Discrete fixed point theorem reconsidered
- Existence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concave
- The Logic of Logistics
- Recent Developments in Discrete Convex Analysis
- On the Solutions of Discrete Nonlinear Complementarity and Related Problems
- Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions
- Extremal Splittings of Point Processes
- On box totally dual integral polyhedra
- A Fenchel-Rockafellar type duality theorem for maximization
- Discrete Convex Analysis
- ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS
- Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
- A survey of fundamental operations on discrete convex functions of various kinds
- On basic operations related to network induction of discrete convex functions
- M♮-Convexity and Its Applications in Operations
- Linear Algebra II
- A Discrete Convex Min-Max Formula for Box-TDI Polyhedra
- Discrete Midpoint Convexity
- Greedy systems of linear inequalities and lexicographically optimal solutions
- On Fundamental Operations for Multimodular Functions
- GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY
- Convex Analysis
- Note on Multimodularity and L-Convexity
- Convex analysis and monotone operator theory in Hilbert spaces
- Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.
