Fetching the paper…
Reading the bibliography…
Linear optimization is many times algorithmically simpler than non-linear convex optimization.
An algorithm for quadratic programming
M. Frank and P. Wolfe · 1956
Earlier work this paper cites.
A least squares estimate of satellite attitude
G. Wahba · 1965
Earlier work this paper cites.
Convergence theory in nonlinear programming
Philip Wolfe · 1970
Earlier work this paper cites.
Convergence rates for conditional gradient sequences generated by implicit step length rules
J.C Dunn · 1980
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. S. Nemirovski and D. B. Yudin · 1983
Earlier work this paper cites.
Minimization methods for non-differentiable functions
N. Z. Shor, Krzysztof C. Kiwiel, and Andrzej Ruszcayǹski · 1985
Earlier work this paper cites.
Some comments on Wolfe’s ‘away step’
Jacques GuéLat and Patrice Marcotte · 1986
Earlier work this paper cites.
A regularization of the Frank—Wolfe method and unification of certain nonlinear programming methods
Athanasios Migdalas · 1994
Earlier work this paper cites.
interior point polynomial methods in convex programming: Theory and applications
Yurii Nesterov and Arkadii Nemirovskii · 1994
Earlier work this paper cites.
Combinatorial Optimization - Polyhedra and Efficiency
A. Schrijver · 2003
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
Martin Zinkevich · 2003
Earlier work this paper cites.
A conditional gradient method with linear rate of convergence for solving convex linear systems
Amir Beck and Marc Teboulle · 2004
Earlier work this paper cites.
On the generalization ability of on-line learning algorithms
Nicolò Cesa-Bianchi, Alex Conconi, and Claudio Gentile · 2004
Earlier work this paper cites.
Online convex optimization in the bandit setting: gradient descent without a gradient
Abraham Flaxman, Adam Tauman Kalai, and H. Brendan McMahan · 2005
Cited alongside, same era.
Efficient algorithms for online decision problems
Adam Tauman Kalai and Santosh Vempala · 2005
Cited alongside, same era.
Prediction, Learning, and Games
Nicolo Cesa-Bianchi and Gabor Lugosi · 2006
Cited alongside, same era.
Logarithmic regret algorithms for online convex optimization
Elad Hazan, Amit Agarwal, and Satyen Kale · 2007
Cited alongside, same era.
Gradient methods for minimizing composite objective function
Y. Nesterov · 2007
Cited alongside, same era.
Linear convergence of a modified Frank-Wolfe algorithm for computing minimum-volume enclosing ellipsoids
S. Damla Ahipasaoglu, Peng Sun, and Michael J. Todd · 2008
Cited alongside, same era.
On the equivalence between herding and conditional gradient algorithms
Francis Bach, Simon Lacoste-Julien, and Guillaume Obozinski · 2012
Later among the works it cites.
Lifted coordinate descent for learning with trace-norm regularization
Miroslav Dudík, Zaïd Harchaoui, and Jérôme Malick · 2012
Later among the works it cites.
Large-scale image classification with trace-norm regularization
Zaïd Harchaoui, Matthijs Douze, Mattis Paulin, Miroslav Dudík, and Jérôme Malick · 2012
Later among the works it cites.
Projection-free online learning
Elad Hazan and Satyen Kale · 2012
Later among the works it cites.
A hybrid algorithm for convex semidefinite optimization
Sören Laue · 2012
Later among the works it cites.
Online learning and online convex optimization
Shai Shalev-Shwartz · 2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
Kenneth L. Clarkson · 2008
Cited alongside, same era.
Sparse approximate solutions to semidefinite programs
Elad Hazan · 2008
Cited alongside, same era.
A simple algorithm for nuclear norm regularized problems
Martin Jaggi and Marek Sulovský · 2010
Cited alongside, same era.
Hedging structured concepts
Wouter M. Koolen, Manfred K. Warmuth, and Jyrki Kivinen · 2010
Cited alongside, same era.
A survey: The convex optimization approach to regret minimization
Elad Hazan · 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.
Dan Garber and Elad Hazan · 2013
Closest in time.
Revisiting Frank-Wolfe: Projection-free sparse convex optimization
Martin Jaggi · 2013
Closest in time.
An affine invariant linear convergence analysis for Frank-Wolfe algorithms
Simon Lacoste-Julien and Martin Jaggi · 2013
Closest in time.
Block-coordinate Frank-Wolfe optimization for structural svms
Simon Lacoste-Julien, Martin Jaggi, Mark Schmidt, and Patrick Pletscher · 2013
Closest in time.
The complexity of large-scale convex programming under a linear optimization oracle
Guanghui Lan · 2013
Closest in time.
Conditional gradient algorithms for norm-regularized smooth convex optimization
Zaïd Harchaoui, Anatoli Juditsky, and Arkadi Nemirovski · 2015
Closest in time.