Corpus ID: 32724082

Efficient Convex Optimization with Membership Oracles

@article{Lee2018EfficientCO,
title={Efficient Convex Optimization with Membership Oracles},
author={Y. Lee and Aaron Sidford and S. Vempala},
journal={ArXiv},
year={2018},
volume={abs/1706.07357}
}
• Published 2018
• Mathematics, Computer Science
• ArXiv
We consider the problem of minimizing a convex function over a convex set given access only to an evaluation oracle for the function and a membership oracle for the set. We give a simple algorithm which solves this problem with $\tilde{O}(n^2)$ oracle calls and $\tilde{O}(n^3)$ additional arithmetic operations. Using this result, we obtain more efficient reductions among the five basic oracles for convex sets and functions defined by Grotschel, Lovasz and Schrijver.

References

SHOWING 1-10 OF 18 REFERENCES
Solving convex programs by random walks
• Mathematics, Computer Science
• STOC '02
• 2002
Simulated Annealing for Convex Optimization
• Mathematics, Computer Science
• Math. Oper. Res.
• 2006
A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization
• Mathematics, Computer Science
• 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
• 2015
Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization
• Mathematics, Computer Science
• 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
• 2006