Integrality of subgradients and biconjugates of integrally convex functions
From MaRDI portal
Publication:2300646
DOI10.1007/s11590-019-01501-1zbMath1433.90055arXiv1806.00992OpenAlexW2987649804MaRDI QIDQ2300646
Publication date: 27 February 2020
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.00992
subgradientbiconjugate functionintegralitydiscrete convex analysisFourier-Motzkin eliminationintegrally convex function
Nonsmooth analysis (49J52) Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial optimization (90C27)
Related Items
Discrete Fenchel duality for a pair of integrally convex and separable convex functions, Recent progress on integrally convex functions, Greedy systems of linear inequalities and lexicographically optimal solutions, A survey of fundamental operations on discrete convex functions of various kinds, On basic operations related to network induction of discrete convex functions, Note on the polyhedral description of the Minkowski sum of two L-convex sets
Cites Work
- Unnamed Item
- Unnamed Item
- A framework of discrete DC programming by discrete convex analysis
- A duality principle for non-convex optimisation and the calculus of variations
- Discrete convex analysis
- Projection and convolution operations for integrally convex functions
- Bisubmodular polyhedra, simplicial divisions, and discrete convexity
- Scaling, proximity, and optimization of integrally convex functions
- Discrete fixed point analysis and its applications
- Submodular functions and optimization.
- Discrete fixed point theorem reconsidered
- Extremal Splittings of Point Processes
- A Fenchel-Rockafellar type duality theorem for maximization
- Discrete Convex Analysis
- Note on Multimodularity and L-Convexity
- Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.