A Steepest Descent Algorithm for M-Convex Functions on Jump Systems

Kazuo MUROTA; Ken'ichiro TANAKA

doi:10.1093/ietfec/e89-a.5.1160

Copy

Kazuo MUROTA, Ken'ichiro TANAKA, "A Steepest Descent Algorithm for M-Convex Functions on Jump Systems" in IEICE TRANSACTIONS on Fundamentals, vol. E89-A, no. 5, pp. 1160-1165, May 2006, doi: 10.1093/ietfec/e89-a.5.1160.
Abstract: The concept of M-convex functions has recently been generalized for functions defined on constant-parity jump systems. The b-matching problem and its generalization provide canonical examples of M-convex functions on jump systems. In this paper, we propose a steepest descent algorithm for minimizing an M-convex function on a constant-parity jump system.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.5.1160/_p

Copy

@ARTICLE{e89-a_5_1160,
author={Kazuo MUROTA, Ken'ichiro TANAKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Steepest Descent Algorithm for M-Convex Functions on Jump Systems},
year={2006},
volume={E89-A},
number={5},
pages={1160-1165},
abstract={The concept of M-convex functions has recently been generalized for functions defined on constant-parity jump systems. The b-matching problem and its generalization provide canonical examples of M-convex functions on jump systems. In this paper, we propose a steepest descent algorithm for minimizing an M-convex function on a constant-parity jump system.},
keywords={},
doi={10.1093/ietfec/e89-a.5.1160},
ISSN={1745-1337},
month={May},}

Copy

TY - JOUR
TI - A Steepest Descent Algorithm for M-Convex Functions on Jump Systems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1160
EP - 1165
AU - Kazuo MUROTA
AU - Ken'ichiro TANAKA
PY - 2006
DO - 10.1093/ietfec/e89-a.5.1160
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2006
AB - The concept of M-convex functions has recently been generalized for functions defined on constant-parity jump systems. The b-matching problem and its generalization provide canonical examples of M-convex functions on jump systems. In this paper, we propose a steepest descent algorithm for minimizing an M-convex function on a constant-parity jump system.
ER -