Fetching the paper…
Reading the bibliography…
Conditional gradients constitute a class of projection-free first-order algorithms for smooth convex optimization.
An algorithm for quadratic programming
M. Frank and P. Wolfe · 1956
Earlier work this paper cites.
Some methods of speeding up the convergence of iteration methods
B. T. Polyak · 1964
Earlier work this paper cites.
Constrained minimization methods
E. S. Levitin and B. T. Polyak · 1966
Earlier work this paper cites.
Finding the point of a polyhedron closest to the origin
B. Mitchell, V. F. Dem’yanov, and V. Malozemov · 1974
Earlier work this paper cites.
An O ( 1 / k ) {O}(1/k) -rate of convergence method for smooth convex functions minimization
Y. E. Nesterov · 1983
Earlier work this paper cites.
Some comments on Wolfe’s ‘away step’
J. Guélat and P. Marcotte · 1986
Earlier work this paper cites.
Network Flows: Theory, Algorithms, and Applications
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin · 1993
Earlier work this paper cites.
Polynomial-time separation of a superclass of simple comb inequalities
L. K. Fleischer, A. N. Letchford, and A. Lodi · 2006
Earlier work this paper cites.
Efficient projections onto the ℓ 1 \ell_{1} -ball for learning in high dimensions
J. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra · 2008
Earlier work this paper cites.
On accelerated proximal gradient methods for convex-concave optimization, 2008
P. Tseng · 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.
Convergence rates of inexact proximal-gradient methods for convex optimization
M. Schmidt, N. L. Roux, and F. R. Bach · 2011
Earlier work this paper cites.
Revisiting Frank-Wolfe: Projection-free sparse convex optimization
M. Jaggi · 2013
Earlier work this paper cites.
Block-coordinate Frank-Wolfe optimization for structural svms
S. Lacoste-Julien, M. Jaggi, M. W. Schmidt, and P. Pletscher · 2013
Earlier work this paper cites.
The complexity of large-scale convex programming under a linear optimization oracle
G. Lan · 2013
Earlier work this paper cites.
Efficient image and video co-localization with Frank-Wolfe algorithm
A. Joulin, K. Tang, and L. Fei-Fei · 2014
Cited alongside, same era.
A geometric alternative to Nesterov’s accelerated gradient descent
S. Bubeck, Y. T. Lee, and M. Singh · 2015
Cited alongside, same era.
On the global linear convergence of Frank-Wolfe optimization variants
S. Lacoste-Julien and M. Jaggi · 2015
Cited alongside, same era.
A universal catalyst for first-order optimization
H. Lin, J. Mairal, and Z. Harchaoui · 2015
Cited alongside, same era.
A linearly convergent variant of the conditional gradient algorithm under strong convexity, with applications to online and stochastic optimization
D. Garber and E. Hazan · 2016
Cited alongside, same era.
Width-independence beyond linear objectives: Distributed fair packing and covering algorithms
J. Diakonikolas, M. Fazel, and L. Orecchia · 2018
Later among the works it cites.
Accelerated extra-gradient descent: A novel, accelerated first-order method
J. Diakonikolas and L. Orecchia · 2018
Later among the works it cites.
An optimal first order method based on optimal quadratic averaging
D. Drusvyatskiy, M. Fazel, and S. Roy · 2018
Later among the works it cites.
Fast generalized conditional gradient method with applications to matrix recovery problems
D. Garber, S. Sabach, and A. Kaplan · 2018
Later among the works it cites.
Restarting Frank–Wolfe
T. Kerdreux, A. d’Aspremont, and S. Pokutta · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Linear-memory and decomposition-invariant linearly convergent conditional gradient algorithm for structured polytopes
D. Garber and O. Meshi · 2016
Cited alongside, same era.
Conditional gradient sliding for convex optimization
G. Lan and Y. Zhou · 2016
Cited alongside, same era.
Decomposition-invariant conditional gradient for general polytopes with line search
M. A. Bashiri and X. Zhang · 2017
Cited alongside, same era.
Lazifying Conditional Gradient Algorithms
G. Braun, S. Pokutta, and D. Zink · 2017
Cited alongside, same era.
An extended Frank-Wolfe method with “in-face” directions, and its application to low-rank matrix completion
R. M. Freund, P. Grigas, and R. Mazumder · 2017
Cited alongside, same era.
Conditional accelerated lazy stochastic gradient descent
G. Lan, S. Pokutta, Y. Zhou, and D. Zink · 2017
Cited alongside, same era.
The matching polytope has exponential extension complexity
T. Rothvoß · 2017
Cited alongside, same era.
T. Kerdreux, F. Pedregosa, and A. D’Aspremont · 2018
Later among the works it cites.
Revisiting first-order convex optimization over linear spaces
F. Locatello, A. Raj, S. P. Reddy, G. Rätsch, B. Schölkopf, S. U. Stich, and M. Jaggi · 2018
Later among the works it cites.
Lectures on Convex Optimization
Y. Nesterov · 2018
Later among the works it cites.
Polytope conditioning and linear convergence of the Frank-Wolfe algorithm
J. Pena and D. Rodriguez · 2018
Later among the works it cites.
Blended conditional gradients: the unconditioning of conditional gradients
G. Braun, S. Pokutta, D. Tu, and S. Wright · 2019
Closest in time.
The approximate duality gap technique: A unified theory of first-order methods
J. Diakonikolas and L. Orecchia · 2019
Closest in time.
Bayesian posterior approximation via greedy particle optimization
F. Futami, Z. Cui, I. Sato, and M. Sugiyama · 2019
Closest in time.
The condition number of a function relative to a set
D. H. Gutman and J. F. Pena · 2019
Closest in time.
MAP inference via block-coordinate Frank-Wolfe algorithm
P. Swoboda and V. Kolmogorov · 2019
Closest in time.