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 i...
| Main Authors: | , , |
|---|---|
| Other Authors: | , , |
| Format: | Article |
| Language: | English |
| Published: |
Springer-Verlag,
2018-05-25T13:39:15Z.
|
| Subjects: | |
| Online Access: | Get fulltext |