Scaling, proximity, and optimization of integrally convex functions
From MaRDI portal
Publication:2414902
DOI10.1007/s10107-018-1234-zzbMath1421.90129arXiv1703.10705OpenAlexW2963240754MaRDI QIDQ2414902
Akihisa Tamura, Fabio Tardella, Kazuo Murota, Satoko Moriguchi
Publication date: 17 May 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.10705
Related Items
Discrete Fenchel duality for a pair of integrally convex and separable convex functions, Recent progress on integrally convex functions, Discrete Midpoint Convexity, Projection and convolution operations for integrally convex functions, Directed discrete midpoint convexity, Integrality of subgradients and biconjugates of integrally convex functions, A survey of fundamental operations on discrete convex functions of various kinds, On basic operations related to network induction of discrete convex functions, Discrete 2-convex functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving discrete systems of nonlinear equations
- Bimonotone linear inequalities and sublattices of \(\mathbb R^n\)
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
- Discrete convex analysis
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
- Notes on L-/M-convex functions and the separation theorems
- L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem
- Coordinatewise domain scaling algorithm for M-convex function minimization
- A capacity scaling algorithm for M-convex submodular flow
- Proximity theorems of discrete convex functions
- Bisubmodular polyhedra, simplicial divisions, and discrete convexity
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
- Discrete fixed point analysis and its applications
- Complexity and algorithms for nonlinear optimization problems
- Discrete fixed point theorem reconsidered
- Existence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concave
- Recent Developments in Discrete Convex Analysis
- M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm
- On the Solutions of Discrete Nonlinear Complementarity and Related Problems
- Discrete Convex Analysis
- L-CONVEXITY ON GRAPH STRUCTURES
- Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
- Discrete Midpoint Convexity
- Convex separable optimization is not much harder than linear optimization
