๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Fully Combinatorial Algorithm for Submodular Function Minimization

โœ Scribed by Satoru Iwata

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
115 KB
Volume
84
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

โœฆ Synopsis

This paper presents a strongly polynomial algorithm for submodular function minimization using only additions, subtractions, comparisons, and oracle calls for function values.

๐Ÿ“œ SIMILAR VOLUMES

A Combinatorial Algorithm Minimizing Sub
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
โœ Alexander Schrijver ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 108 KB

We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear programming method. No bound on the complexity of the values of f is needed to be known a priori. The number of oracle c

In Favor of Conjugate Directions: a Gene
In Favor of Conjugate Directions: a Generalized Acceptable-point Algorithm for Function Minimization
โœ M.A. Townsend; G.E. Johnson ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 915 KB

## A generalization of the conjugate directions minimization technique enables utilization of a coarse univariate subsearch to identify acceptable points (as opposed to a minimizing line search) and performs better than commonly-used conjugate directions algorithms. It performs comparably to and has