5 research outputs found
A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization
We improve upon the running time for finding a point in a convex set given a
separation oracle. In particular, given a separation oracle for a convex set
contained in a box of radius , we show how to either
find a point in or prove that does not contain a ball of radius
using an expected oracle evaluations and
additional time . This matches the oracle
complexity and improves upon the additional
time of the previous fastest algorithm achieved over 25 years ago by Vaidya for
the current matrix multiplication constant when
.
Using a mix of standard reductions and new techniques, our algorithm yields
improved runtimes for solving classic problems in continuous and combinatorial
optimization:
Submodular Minimization: Our weakly and strongly polynomial time algorithms
have runtimes of and
, improving upon the previous
best of and .
Matroid Intersection: Our runtimes are and , achieving the first quadratic bound on the query complexity for the
independence and rank oracles. In the unweighted case, this is the first
improvement since 1986 for independence oracle.
Submodular Flow: Our runtime is , improving upon the previous bests from
15 years ago roughly by a factor of .
Semidefinite Programming: Our runtime is ,
improving upon the previous best of for
the regime where the number of nonzeros is small.Comment: 111 pages, FOCS 201
Fair Integral Network Flows
A strongly polynomial algorithm is developed for finding an integer-valued
feasible -flow of given flow-amount which is decreasingly minimal on a
specified subset of edges in the sense that the largest flow-value on
is as small as possible, within this, the second largest flow-value on is
as small as possible, within this, the third largest flow-value on is as
small as possible, and so on. A characterization of the set of these -flows
gives rise to an algorithm to compute a cheapest -decreasingly minimal
integer-valued feasible -flow of given flow-amount. Decreasing minimality
is a possible formal way to capture the intuitive notion of fairness.Comment: 37 page