Abstract
The author recently introduced a concept of a subdifferential of a submodular function defined on a distributive lattice. Each subdifferential is an unbounded polyhedron. In the present paper we determine the set of all the extreme points and rays of each subdifferential and show the relationship between subdifferentials of a submodular function and subdifferentials, in an ordinary sense of convex analysis, of Lovász's extension of the submodular function. Furthermore, for a modular function on a distributive lattice we give an algorithm for determining which subdifferential contains a given vector and finding a nonnegative linear combination of extreme vectors of the subdifferential which expresses the given vector minus the unique extreme point of the subdifferential.
Similar content being viewed by others
References
J. Edmonds, “Submodular functions, matroids, and certain polyhedra”, Proceedings of the Calgary International Conference on Combinatorial Structures and Their Applications (Gordon and Breach, New York 1970) pp. 69–87.
U. Faigle, “The greedy algorithm for partially ordered sets”,Discrete Mathematics 28 (1979) 153–159.
L.R. Ford, Jr. and D.R. Fulkerson,Flows in networks (Princeton University Press, Princeton, N.J., 1962).
S. Fujishige, “The independent-flow problems and submodular functions” (in Japanese),Journal of the Faculty of Engineering, University of Tokyo A-16 (1978) 42–43.
S. Fujishige, “Structures of polyhedra determined by submodular functions on crossing families”,Mathematical Programming 29 (1984) 125–141.
S. Fujishige, “Theory of submodular programs: A Fenchel-type min-max theorem and subgradients of submodular functions”,Mathematical Programming 29 (1984) 142–155.
S. Fujishige and N. Tomizawa, “A note on submodular functions on distributive lattices”Journal of the Operations Research Society of Japan 26 (1983) 309–318.
A.J. Hoffman, “Some recent applications of the theory of linear inequalities to extremal combinatorial analysis”,Proceedings of the Symposium in Applied Mathematics 10 (1960) 113–127.
B. Korte and L. Lovász, “Mathematical structures underlying greedy algorithms”, Report No. 81189-OR, Institut für Ökonometrie und Operations Research. Universität Bonn (July 1981).
L. Lovász, “Submodular functions and convexity”, presented at the XI. International Symposium on Mathematical Programming, Bonn, August 23–27, 1982.
C.J.H. McDiarmid, “Rado's theorem for polymatroids”,Mathematical Proceedings of the Cambridge Philosophical Society 78 (1975) 263–281.
J.C. Picard, “Maximal closure of a graph and applications to combinatorial problems”,Management Science 22 (1976), 1268–1272.
R.T. Rockafellar,Convex analysis (Princeton University Press, Princeton, N.J., 1970).
J. Stoer and C. Witzgall,Convexity and optimization in finite dimensions I (Springer, Berlin, 1970).
N. Tomizawa, “Theory of hyperspace (I)—Supermodular functions and generalization of concept of ‘bases’” (in Japanese), Papers of The Technical Group on Circuits and Systems, Institute of Electronics and Communication Engineers of Japan. CAS80-72 (September 1980).
N. Tomizawa, unpublished note (July 1982), included in “Theory of hyperspace (XVI)—On the structures of hedrons” (in Japanese), ibid., Papers of The Technical Group on Circuits and Systems, Institute of Electronics and Communication Engineers of Japan. CAS82-174 (March 1983).
N. Tomizawa and S. Fujishige, “Theory of hyperspace (VIII)—On the structures of hypermatroids of network type” (in Japanese), ibid., Papers of The Technical Group on Circuits and Systems, Institute of Electronics and Communication Engineers of Japan, CAS81-62 (September 1981).
Author information
Authors and Affiliations
Additional information
The present research was carried out when the author was on leave at Institut für Ökonometrie und Operations Research, Universität Bonn, and was supported by the Alexander von Humboldt Fellowship (1982/83), West Germany.
Rights and permissions
About this article
Cite this article
Fujishige, S. On the subdifferential of a submodular function. Mathematical Programming 29, 348–360 (1984). https://doi.org/10.1007/BF02592001
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02592001