Mathematical Programming

, Volume 152, Issue 1–2, pp 435–466

A framework of discrete DC programming by discrete convex analysis

Full Length Paper Series A

DOI: 10.1007/s10107-014-0792-y

Cite this article as:
Maehara, T. & Murota, K. Math. Program. (2015) 152: 435. doi:10.1007/s10107-014-0792-y

Abstract

A theoretical framework of difference of discrete convex functions (discrete DC functions) and optimization problems for discrete DC functions is established. Standard results in continuous DC theory are exported to the discrete DC theory with the use of discrete convex analysis. A discrete DC algorithm, which is a discrete analogue of the continuous DC algorithm (Concave–Convex procedure in machine learning) is proposed. The algorithm contains the submodular-supermodular procedure as a special case. Exploiting the polyhedral structure of discrete convex functions, the algorithms tailored to specific types of discrete DC functions are proposed.

Mathematics Subject Classification

90C27 90C46 

Copyright information

© Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society 2014

Authors and Affiliations

  1. 1.JST, ERATO, Kawarabayashi ProjectNational Institute of InformaticsTokyoJapan
  2. 2.Department of Mathematical InformaticsUniversity of TokyoTokyoJapan

Personalised recommendations