Fetching the paper…
Reading the bibliography…
In this paper, the online variants of the classical Frank-Wolfe algorithm are considered.
An algorithm for quadratic programming
M. Frank and P. Wolfe · 1956
Earlier work this paper cites.
Convergence theory in nonlinear programming
P. Wolfe · 1970
Earlier work this paper cites.
A linearization method in limiting extremal problems
Yu. M. Ermol’ev and P. I. Verchenko · 1976
Earlier work this paper cites.
Topics in matrix analysis
R. A. Horn and C. R. Johnson · 1991
Earlier work this paper cites.
Covering a ball with smaller equal balls in
Jean-Louis Verger Gaugry · 2005
Earlier work this paper cites.
Single-pixel imaging via compressive sampling
Marco Duarte, Mark Davenport, Dharmpal Takhar, Jason Laska, Ting Sun, Kevin Kelly, and Richard Baraniuk · 2008
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Earlier work this paper cites.
Stochastic convex optimization
S. Shalev-Shwartz, O. Shamir, N. Srebro, and K. Sridharan · 2009
Earlier work this paper cites.
Optimal algorithms for online convex optimization with multi-point bandit feedback
A. Agarwal, O. Dekel, and L. Xiao · 2010
Earlier work this paper cites.
LIBSVM: A library for support vector machines
C.-C. Chang and C.-J. Lin · 2011
Earlier work this paper cites.
Nonconvex online support vector machines
S. Ertekin, L. Bottou, and C. Lee Giles · 2011
Earlier work this paper cites.
Information-based complexity, feedback and dynamics in convex programming
M. Raginsky and A. Rakhlin · 2011
Cited alongside, same era.
Learning kernel-based halfspaces with the 0-1 loss
S. Shalev-Shwartz, Ohad Shamir, and Karthik Sidharan · 2011
Cited alongside, same era.
Projection-free online learning
E. Hazan and S. Kale · 2012
Cited alongside, same era.
First-Order Methods for Nonsmooth Convex Large-Scale Optimization, I: General Purpose Methods
A. B. Juditsky and A. S. Nemirovski · 2012
Cited alongside, same era.
First-Order Methods for Nonsmooth Convex Large-Scale Optimization, II: Utilizing Problem’s Structure
A. B. Juditsky and A. S. Nemirovski · 2012
Cited alongside, same era.
Convergence of Stochastic Proximal Gradient Algorithm
L. Rosasco, S. Villa, and Bang Cong Vu · 2014
Later among the works it cites.
Generalized conditional gradient for sparse estimation
Yaoliang Yu, Xinhua Zhang, and Dale Schuurmans · 2014
Later among the works it cites.
Faster rates for the Frank-Wolfe method over strongly-convex sets
D. Garber and E. Hazan · 2015
Closest in time.
D. Garber and E. Hazan · 2015
Closest in time.
Escaping from saddle points — online stochastic gradient for tensor decomposition
R. Ge, F. Huang, C. Jin, and Y. Yuan · 2015
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Robert M. Freund and Paul Grigas · 2013
Cited alongside, same era.
Revisiting Frank-Wolfe: Projection-free sparse convex optimization
M. Jaggi · 2013
Cited alongside, same era.
A remark on low rank matrix recovery and noncommutative Bernstein type inequalities
V. Koltchinskii · 2013
Cited alongside, same era.
An affine invariant linear convergence analysis for Frank-Wolfe algorithms
S. Lacoste-Julien and M. Jaggi · 2013
Cited alongside, same era.
Nuclear norm minimization via active subspace selection
C.-J. Hsieh and P. A. Olsen · 2014
Cited alongside, same era.
Noisy low-rank matrix completion with general sampling distribution
O. Klopp · 2014
Cited alongside, same era.
Conditional gradient sliding for convex optimization
G. Lan and Y. Zhou · 2014
Cited alongside, same era.
S. Ghosh and H. Lam · 2015
Closest in time.
The movielens datasets: History and context
F. M. Harper and J. A. Konstan · 2015
Closest in time.
On the global linear convergence of Frank-Wolfe optimization variants
S. Lacoste-Julien and M. Jaggi · 2015
Closest in time.
Variance reduction for faster non-convex optimization
Z. Allen-Zhu and E. Hazan · 2016
Closest in time.
Variance-reduced and projection-free stochastic optimization
E. Hazan and H. Luo · 2016
Closest in time.
Structured nonconvex and nonsmooth optimization: Algorithms and iteration complexity analysis
Bo Jiang, Tianyi Lin, Shiqian Ma, and Shuzhong Zhang · 2016
Closest in time.
Convergence rate of frank-wolfe for non-convex objectives
S. Lacoste-Julien · 2016
Closest in time.