Algorithms in Discrete Convex Analysis
Summary :
This is a survey of algorithmic results in the theory of "discrete convex analysis" for integer-valued functions defined on integer lattice points. The theory parallels the ordinary convex analysis, covering discrete analogues of the fundamental concepts such as conjugacy, the Fenchel min-max duality, and separation theorems. The technical development is based on matroid-theoretic concepts, in particular, submodular functions and exchange axioms.
- Publication
- IEICE TRANSACTIONS on Information Vol.E83-D No.3 pp.344-352
- Publication Date
- 2000/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- INVITED SURVEY PAPER
- Category
- Algorithms for Matroids and Related Discrete Systems
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kazuo MUROTA, "Algorithms in Discrete Convex Analysis" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 3, pp. 344-352, March 2000, doi: .
Abstract: This is a survey of algorithmic results in the theory of "discrete convex analysis" for integer-valued functions defined on integer lattice points. The theory parallels the ordinary convex analysis, covering discrete analogues of the fundamental concepts such as conjugacy, the Fenchel min-max duality, and separation theorems. The technical development is based on matroid-theoretic concepts, in particular, submodular functions and exchange axioms.
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_3_344/_p
Copy
@ARTICLE{e83-d_3_344,
author={Kazuo MUROTA, },
journal={IEICE TRANSACTIONS on Information},
title={Algorithms in Discrete Convex Analysis},
year={2000},
volume={E83-D},
number={3},
pages={344-352},
abstract={This is a survey of algorithmic results in the theory of "discrete convex analysis" for integer-valued functions defined on integer lattice points. The theory parallels the ordinary convex analysis, covering discrete analogues of the fundamental concepts such as conjugacy, the Fenchel min-max duality, and separation theorems. The technical development is based on matroid-theoretic concepts, in particular, submodular functions and exchange axioms.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Algorithms in Discrete Convex Analysis
T2 - IEICE TRANSACTIONS on Information
SP - 344
EP - 352
AU - Kazuo MUROTA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2000
AB - This is a survey of algorithmic results in the theory of "discrete convex analysis" for integer-valued functions defined on integer lattice points. The theory parallels the ordinary convex analysis, covering discrete analogues of the fundamental concepts such as conjugacy, the Fenchel min-max duality, and separation theorems. The technical development is based on matroid-theoretic concepts, in particular, submodular functions and exchange axioms.
ER -
English
