Fetching the paper…
Reading the bibliography…
We propose a new framework for black-box convex optimization which is well-suited for situations where gradient computations are expensive.
Partitions of mass-distributions and of convex bodies by hyperplanes
B. Grünbaum · 1960
Earlier work this paper cites.
Problem Complexity and Method Efficiency in Optimization
A. Nemirovski and D. Yudin · 1983
Earlier work this paper cites.
A cutting plane algorithm for convex programming that uses analytic centers
David S Atkinson and Pravin M Vaidya · 1995
Earlier work this paper cites.
A cutting plane method from analytic centers for stochastic programming
Olivier Bahn, O Du Merle, J-L Goffin, and J-P Vial · 1995
Earlier work this paper cites.
A new algorithm for minimizing convex functions over convex sets
P. M. Vaidya · 1996
Earlier work this paper cites.
Shallow, deep and very deep cuts in the analytic center cutting plane method
Jean-Louis Goffin and Jean-Philippe Vial · 1999
Earlier work this paper cites.
The volumetric barrier for convex quadratic constraints
M. K. Anstreicher · 2004
Cited alongside, same era.
Introductory lectures on convex optimization: A basic course
Y. Nesterov · 2004
Cited alongside, same era.
Templates for convex cone problems with applications to sparse signal recovery
Stephen R Becker, Emmanuel J Candès, and Michael C Grant · 2011
Cited alongside, same era.
Libsvm: A library for support vector machines
Chih-Chung Chang and Chih-Jen Lin · 2011
Cited alongside, same era.
A stochastic gradient method with an exponential convergence rate for strongly-convex optimization with finite training sets
N. Le Roux, M. Schmidt, and F. Bach · 2012
Cited alongside, same era.
minfunc: unconstrained differentiable multivariate optimization in matlab
M Schmidt · 2012
Fine tuning nesterov’s steepest descent algorithm for differentiable convex programming
Clóvis C Gonzaga and Elizabeth W Karas · 2013
Later among the works it cites.
Accelerating stochastic gradient descent using predictive variance reduction
R. Johnson and T. Zhang · 2013
Later among the works it cites.
Convex optimization: Algorithms and complexity
S. Bubeck · 2015
Later among the works it cites.
A geometric alternative to nesterov’s accelerated gradient descent
S. Bubeck, Y.-T. Lee, and M. Singh · 2015
Later among the works it cites.
A faster cutting plane method and its implications for combinatorial and convex optimization
Y.-T. Lee, A. Sidford, and S. C.-W Wong · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.