Fetching the paper…
Reading the bibliography…
Traditional algorithms for stochastic optimization require projecting the solution at each iteration into a given domain to ensure its feasibility.
An algorithm for quadratic programming
Marguerite Frank and Philip Wolfe · 1956
Earlier work this paper cites.
Constrained minimization methods
Evgenij S Levitin and Boris T Polyak · 1966
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. Nemirovski and D. B. Yudin · 1983
Earlier work this paper cites.
Introductory lectures on convex optimization: a basic course , volume 87 of Applied optimization
Yurii Nesterov · 2004
Earlier work this paper cites.
Solving large scale linear prediction problems using stochastic gradient descent algorithms
Tong Zhang · 2004
Earlier work this paper cites.
Local rademacher complexities
Peter L. Bartlett, Olivier Bousquet, and Shahar Mendelson · 2005
Earlier work this paper cites.
Prox-method with rate of convergence o(1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems
Arkadi Nemirovski · 2005
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Yu. Nesterov · 2005
Earlier work this paper cites.
Prediction, Learning, and Games
Nicolo Cesa-Bianchi and Gábor Lugosi · 2006
Earlier work this paper cites.
Gradient methods for minimizing composite objective function
Yurii Nesterov · 2007
Earlier work this paper cites.
Sparse approximate solutions to semidefinite programs
Elad Hazan · 2008
Earlier work this paper cites.
Topmoumoute online natural gradient algorithm
Nicolas Le Roux, Pierre-Antoine Manzagol, and Yoshua Bengio · 2008
Earlier work this paper cites.
Accelerated gradient methods for stochastic optimization and online learning
Chonghai Hu, James Kwok, and Weike Pan · 2009
Cited alongside, same era.
Regularized distance metric learning: Theory and algorithm
Rong Jin, Shijun Wang, and Yang Zhou · 2009
Cited alongside, same era.
Robust stochastic approximation approach to stochastic programming
A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Cited alongside, same era.
Stochastic convex optimization
Shai Shalev-Shwartz, Ohad Shamir, Nathan Srebro, and Karthik Sridharan · 2009
Cited alongside, same era.
Geometry on probability spaces
Steve Smale and Ding-Xuan Zhou · 2009
Cited alongside, same era.
Coresets, sparse greedy approximation, and the frank-wolfe algorithm
Kenneth L. Clarkson · 2010
Cited alongside, same era.
Pegasos: primal estimated sub-gradient solver for svm
Shai Shalev-Shwartz, Yoram Singer, Nathan Srebro, and Andrew Cotter · 2011
Later among the works it cites.
Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization
Alekh Agarwal, Peter L. Bartlett, Pradeep Ravikumar, and Martin J. Wainwright · 2012
Later among the works it cites.
Optimal regularized dual averaging methods for stochastic optimization
Xi Chen, Qihang Lin, and Javier Pena · 2012
Later among the works it cites.
Optimal distributed online prediction using mini-batches
Ofer Dekel, Ran Gilad-Bachrach, Ohad Shamir, and Lin Xiao · 2012
Later among the works it cites.
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization i: A generic algorithmic framework
Saeed Ghadimi and Guanghui Lan · 2012
Later among the works it cites.
Projection-free online learning
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Primal-dual subgradient methods for minimizing uniformly convex functions
Anatoli Juditsky and Yuri Nesterov · 2010
Cited alongside, same era.
Better mini-batch algorithms via accelerated gradient methods
Andrew Cotter, Ohad Shamir, Nati Srebro, and Karthik Sridharan · 2011
Cited alongside, same era.
Optimal distributed online prediction
Ofer Dekel, Ran Gilad-Bachrach, Ohad Shamir, and Lin Xiao · 2011
Cited alongside, same era.
Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization
Elad Hazan and Satyen Kale · 2011
Cited alongside, same era.
Solving variational inequalities with stochastic mirror-prox algorithm
Anatoli Juditsky, Arkadi Nemirovski, and Claire Tauvel · 2011
Cited alongside, same era.
Elad Hazan and Satyen Kale · 2012
Later among the works it cites.
An optimal method for stochastic composite optimization
Guanghui Lan · 2012
Later among the works it cites.
Stochastic gradient descent with only one projection
Mehrdad Mahdavi, Tianbao Yang, Rong Jin, Shenghuo Zhu, and Jinfeng Yi · 2012
Later among the works it cites.
Making gradient descent optimal for strongly convex stochastic optimization
Alexander Rakhlin, Ohad Shamir, and Karthik Sridharan · 2012
Later among the works it cites.
Revisiting frank-wolfe: Projection-free sparse convex optimization
Martin Jaggi · 2013
Closest in time.
Block-coordinate frank-wolfe optimization for structural svm
Simon Lacoste-Julien, Martin Jaggi, Mark Schmidt, and Patrick Pletscher · 2013
Closest in time.