Fetching the paper…
Reading the bibliography…
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.
Geometric algorithms and combinatorial optimization
Martin Grötschel, László Lovász, and Alexander Schrijver · 1988
Earlier work this paper cites.
Algorithms for approximate calculation of the minimum of a convex function from its values
V. Yu. Protasov · 1996
Earlier work this paper cites.
A new algorithm for minimizing convex functions over convex sets
P. M. Vaidya · 1996
Earlier work this paper cites.
Solving convex programs by random walks
Dimitris Bertsimas and Santosh Vempala · 2004
Earlier work this paper cites.
Simulated annealing for convex optimization
A. T. Kalai and S. Vempala · 2006
Earlier work this paper cites.
Fast algorithms for logconcave functions: sampling, rounding, integration and optimization
L. Lovász and S. Vempala · 2006
Earlier work this paper cites.
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
Paul Christiano, Jonathan A Kelner, Aleksander Madry, Daniel A Spielman, and Shang-Hua Teng · 2011
Cited alongside, same era.
A new approach to computing maximum flows using electrical flows
Yin Tat Lee, Satish Rao, and Nikhil Srivastava · 2013
Cited alongside, same era.
Navigating central path with electrical flows: From flows to matchings, and back
Aleksander Madry · 2013
Cited alongside, same era.
Nearly maximum flows in nearly linear time
Jonah Sherman · 2013
Cited alongside, same era.
An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations
Jonathan A Kelner, Yin Tat Lee, Lorenzo Orecchia, and Aaron Sidford · 2014
Cited alongside, same era.
Multi-scale exploration of convex functions and bandit convex optimization
Sébastien Bubeck and Ronen Eldan · 2015
Later among the works it cites.
Efficient inverse maintenance and faster algorithms for linear programming
Yin Tat Lee and Aaron Sidford · 2015
Later among the works it cites.
A faster cutting plane method and its implications for combinatorial and convex optimization
Yin Tat Lee, Aaron Sidford, and Sam Chiu-wai Wong · 2015
Later among the works it cites.
Sharp l 1-poincaré inequalities correspond to optimal hypersurface cuts
Stefan Steinerberger · 2015
Later among the works it cites.
Faster convex optimization: Simulated annealing with an efficient universal barrier
Jacob D. Abernethy and Elad Hazan · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Yin Tat Lee and Aaron Sidford · 2014
Cited alongside, same era.
Area-convexity, l ∞ {}_{\mbox{{$\infty$}}} regularization, and undirected multicommodity flow
Jonah Sherman · 2017
Closest in time.