Discrete Newton’s Algorithm for Parametric Submodular Function Minimization
We consider the line search problem in a submodular polyhedron P (f) ⊆ ℝ n : Given an arbitrary a ∈ ℝ n and x 0 ∈ P (f), compute max{δ: x 0 + δa ∈ P (f)}. The use of the discrete Newton’s algorithm for this line search problem is very natural, but no strongly polynomial bound on its number of ite...
| Главные авторы: | , , |
|---|---|
| Другие авторы: | |
| Формат: | Статья |
| Опубликовано: |
Springer-Verlag
2018
|
| Online-ссылка: | http://hdl.handle.net/1721.1/115886 https://orcid.org/0000-0002-0520-1165 https://orcid.org/0000-0003-2305-2949 https://orcid.org/0000-0002-8585-6566 |
| Итог: | We consider the line search problem in a submodular polyhedron P (f) ⊆ ℝ n : Given an arbitrary a ∈ ℝ n and x 0 ∈ P (f), compute max{δ: x 0 + δa ∈ P (f)}. The use of the discrete Newton’s algorithm for this line search problem is very natural, but no strongly polynomial bound on its number of iterations was known (Iwata 2008). We solve this open problem by providing a quadratic bound of n 2 + O(n log 2 n) on its number of iterations. Our result considerably improves upon the only other known strongly polynomial time algorithm, which is based on Megiddo’s parametric search framework and which requires Õ(n 8 ) submodular function minimizations (Nagano 2007). As a by-product of our study, we prove (tight) bounds on the length of chains of ring families and geometrically increasing sequences of sets, which might be of independent interest. Keywords:
Discrete Newton’s algorithm; Submodular functions; Line search; Ring families; Geometrically increasing sequence of sets; Fractional combinatorial optimization |
|---|