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: | Goemans, Michel X (Contributor), Gupta, Swati (Contributor), Jaillet, Patrick (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Department of Mathematics (Contributor), Sloan School of Management (Contributor) |
Format: | Article |
Language: | English |
Published: |
Springer-Verlag,
2018-05-25T13:39:15Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Algorithms for Symmetric Submodular Function Minimization under Hereditary Constraints and Generalizations
by: Goemans, Michel X., et al.
Published: (2013) -
Approximating Submodular Functions Everywhere
by: Goemans, Michel X., et al.
Published: (2011) -
A simple combinatorial algorithm for submodular function minimization
by: Iwata, Satoru, et al.
Published: (2011) -
Approximation Algorithms for the Submodular Load Balancing with Submodular Penalties
by: Xiaofei Liu, et al.
Published: (2020-10-01) -
Scheduling to minimize power consumption using submodular functions
by: Zadimoghaddam, Morteza
Published: (2011)