A Steepest Descent Algorithm for M-Convex Functions on Jump Systems(<Special Section>Discrete Mathematics and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 2006-05-01

著者

• Tanaka Ken'ichiro

  Graduate School Of Information Science And Technology University Of Tokyo

• MUROTA Kazuo

  Graduate School of Information Science and Technology, University of Tokyo

• Murota Kazuo

  Graduate School Of Information Science And Technology University Of Tokyo

• Kazuo Murota

  Graduate School of Information Science and Technology, University of Tokyo

関連論文

• A Steepest Descent Algorithm for M-Convex Functions on Jump Systems(Discrete Mathematics and Its Applications)
• Discrete Hessian Matrix for L-Convex Functions(Discrete Mathematics and Its Applications)
• Fundamental Properties of M-Convex and L-Convex Functions in Continuous Variables(Discrete Mathematics and Its Applications)

スポンサーリンク