Simple Iterative Methods for Linear Optimization over Convex Sets

by   Daniel Dadush, et al.

We give simple iterative methods for computing approximately optimal primal and dual solutions for the problem of maximizing a linear functional over a convex set K given by a separation oracle. In contrast to prior work, our algorithms directly output primal and dual solutions and avoid a common requirement of binary search on the objective value. Under the assumption that K contains a ball of radius r and is contained inside the origin centered ball of radius R, using O(R^4/r^2 ε^2) iterations and calls to the oracle, our main method outputs a point x ∈ K together with a non-negative combination of the inequalities outputted by the oracle and one inequality of the R-ball certifying that x is an additive ε-approximate solution. In the setting where the inner r-ball is centered at the origin, we give a simplified variant which outputs a multiplicative (1 + ε)-approximate primal and dual solutions using O(R^2/r^2 ε^2) iterations and calls to the oracle. Similar results hold for packing type problems. Our methods are based on variants of the classical Von Neumann and Frank-Wolfe algorithms. Our algorithms are also easy to implement, and we provide an experimental evaluation of their performance on a testbed of maximum matching and stable set instances. We further compare variations of our method to the standard cut loop implemented using Gurobi.This comparison reveals that in terms of iteration count, our methods converge on average faster than the standard cut loop on our test set.


page 1

page 2

page 3

page 4


Acceleration with a Ball Optimization Oracle

Consider an oracle which takes a point x and returns the minimizer of a ...

Faster Primal-Dual Convergence for Min-Max Resource Sharing and Stronger Bounds via Local Weak Duality

We revisit the (block-angular) min-max resource sharing problem, which i...

Approximate Frank-Wolfe Algorithms over Graph-structured Support Sets

In this paper, we propose approximate Frank-Wolfe (FW) algorithms to sol...

Fast Stochastic Composite Minimization and an Accelerated Frank-Wolfe Algorithm under Parallelization

We consider the problem of minimizing the sum of two convex functions. O...

Distributionally Robust Optimization via Ball Oracle Acceleration

We develop and analyze algorithms for distributionally robust optimizati...

Non-simplicial Delaunay meshing via approximation by radical partitions

We consider the construction of a polyhedral Delaunay partition as a lim...

Comparison of FETI-based domain decomposition methods for topology optimization problems

We critically assess the performance of several variants of dual and dua...

Please sign up or login with your details

Forgot password? Click here to reset