Proximity theorems of discrete convex functions
From MaRDI portal
The authors present proximity theorems and optimality criteria for convex functions, namely \((L,M,L_2,M_2)\) convex functions. It is stated that these results can easily be extended to other variants of these convex functions investigated by \textit{S. Fujishige} and \textit{K. Murota} [Math. Program. 88, No. 1 (A), 129--146 (2000; Zbl 0974.90019)] and \textit{K. Murota} and \textit{A. Shioura} [Math. Oper. Res. 24, No. 1, 95--105 (1999; Zbl 0977.90044)].
Recommendations
- Combinatorial Image Analysis
- Discrete convexity and its applications
- SEVERAL DISCRETE INEQUALITIES FOR CONVEX FUNCTIONS
- Discrete convexity
- scientific article; zbMATH DE number 4011133
- scientific article; zbMATH DE number 3909024
- Discrete convexity: Convexity for functions defined on discrete spaces
- scientific article; zbMATH DE number 5827845
- A best proximity point theorem using discontinuous functions
- Differentiability of Distance Functions and a Proximinal Property Inducing Convexity
Cited in
(8)- Scaling, proximity, and optimization of integrally convex functions
- Recent developments in discrete convex analysis
- Sensitivity analysis for convex separable optimization over integral polymatroids
- Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function
- Discrete convexity and polynomial solvability in minimum 0-extension problems
- Recent progress on integrally convex functions
- Generalized minimum 0-extension problem and discrete convexity
- (Near)-optimal algorithms for sparse separable convex integer programs
This page was built for publication: Proximity theorems of discrete convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1881049)
