A Steepest Descent Algorithm for M-Convex Functions on Jump Systems
Kazuo Murota · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2006
The concept of M-convex functions has recently been generalized for functions defined on constant-parity jump systems.The bmatching problem and its generalization provide canonical examples of Mconvex 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.