A descent method for submodular function minimization
暂无分享,去创建一个
Abstract.We show a descent method for submodular function minimization based on an oracle for membership in base polyhedra. We assume that for any submodular function f: ?→R on a distributive lattice ?⊆2V with ?,V∈? and f(?)=0 and for any vector x∈RV where V is a finite nonempty set, the membership oracle answers whether x belongs to the base polyhedron associated with f and that if the answer is NO, it also gives us a set Z∈? such that x(Z)>f(Z). Given a submodular function f, by invoking the membership oracle O(|V|2) times, the descent method finds a sequence of subsets Z1,Z2,···,Zk of V such that f(Z1)>f(Z2)>···>f(Zk)=min{f(Y) | Y∈?}, where k is O(|V|2). The method furnishes an alternative framework for submodular function minimization if combined with possible efficient membership algorithms.
[1] Alexander Schrijver,et al. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.
[2] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[3] Satoru Fujishige,et al. Submodular functions and optimization , 1991 .
[4] Satoru Iwata,et al. A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.