Fetching the paper…
Reading the bibliography…
The Frank-Wolfe (FW) optimization algorithm has lately re-gained popularity thanks in particular to its ability to nicely handle the structured constraints appearing in machine learning applications.
An algorithm for quadratic programming
M. Frank and P. Wolfe · 1956
Earlier work this paper cites.
Constrained minimization methods
E. S. Levitin and B. T. Polyak · 1966
Earlier work this paper cites.
A tight upper bound on the rate of convergence of Frank-Wolfe algorithm
M. D. Canon and C. D. Cullum · 1968
Earlier work this paper cites.
Convergence theory in nonlinear programming
P. Wolfe · 1970
Earlier work this paper cites.
An extension of the Frank and Wolfe method of feasible directions
C. A. Holloway · 1974
Earlier work this paper cites.
Finding the point of a polyhedron closest to the origin
B. Mitchell, V. F. Demyanov, and V. Malozemov · 1974
Earlier work this paper cites.
Finding the nearest point in a polytope
P. Wolfe · 1976
Earlier work this paper cites.
The width and diameter of a simplex
R. Alexander · 1977
Earlier work this paper cites.
Simplicial decomposition in nonlinear programming algorithms
B. Von Hohenbalken · 1977
Earlier work this paper cites.
Rates of convergence for conditional gradient algorithms near singular and nonsingular extremals
J. C. Dunn · 1979
Earlier work this paper cites.
Generalized Equations and their Solutions, Part II: Applications to Nonlinear Programming
S. M. Robinson · 1982
Earlier work this paper cites.
Some comments on Wolfe’s ‘away step’
J. Guélat and P. Marcotte · 1986
Earlier work this paper cites.
Restricted simplicial decomposition: Computation and extensions
D. Hearn, S. Lawphongpanich, and J. Ventura · 1987
Earlier work this paper cites.
Lectures on Polytopes , volume 152 of Graduate Texts in Mathematics
G. M. Ziegler · 1995
Earlier work this paper cites.
Fast training of support vector machines using sequential minimal optimization
J. C. Platt · 1999
Cited alongside, same era.
Lectures on 0/1-polytopes
G. M. Ziegler · 1999
Cited alongside, same era.
Nonlinear programming
D. P. Bertsekas · 1999
Cited alongside, same era.
A faster scaling algorithm for minimizing submodular functions
S. Iwata · 2002
Cited alongside, same era.
A conditional gradient method with linear rate of convergence for solving convex linear systems
A. Beck and M. Teboulle · 2004
Cited alongside, same era.
What energy functions can be minimized via graph cuts?
V. Kolmogorov and R. Zabin · 2004
Cited alongside, same era.
Block-coordinate Frank-Wolfe optimization for structural SVMs
S. Lacoste-Julien, M. Jaggi, M. Schmidt, and P. Pletscher · 2013
Later among the works it cites.
The complexity of large-scale convex programming under a linear optimization oracle
G. Lan · 2013
Later among the works it cites.
A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training
H. Allende, E. Frandi, R. Nanculef, and C. Sartori · 2013
Later among the works it cites.
Efficient image and video co-localization with Frank-Wolfe algorithm
A. Joulin, K. Tang, and L. Fei-Fei · 2014
Later among the works it cites.
A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training
R. Ñanculef, E. Frandi, C. Sartori, and H. Allende · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Y. Nesterov · 2004
Cited alongside, same era.
Linear convergence of a modified Frank-Wolfe algorithm for computing minimum-volume enclosing ellipsoids
S. D. Ahipașaoğlu, P. Sun, and M. Todd · 2008
Cited alongside, same era.
Graphical models, exponential families, and variational inference
M. J. Wainwright and M. I. Jordan · 2008
Cited alongside, same era.
A linearly convergent linear-time first-order algorithm for support vector classification with a core set result
P. Kumar and E. A. Yildirim · 2010
Cited alongside, same era.
Learning with submodular functions: A convex optimization perspective
F. Bach · 2013
Cited alongside, same era.
D. Garber and E. Hazan · 2013
Cited alongside, same era.
Iteration complexity of feasible descent methods for convex optimization
P.-W. Wang and C.-J. Lin · 2014
Later among the works it cites.
Provable submodular minimization using Wolfe’s algorithm
D. Chakrabarty, P. Jain, and P. Kothari · 2014
Later among the works it cites.
Linearly convergent away-step conditional gradient for non-strongly convex functions
A. Beck and S. Shtern · 2015
Closest in time.
On pairwise costs for network flow multi-object tracking
V. Chari et al · 2015
Closest in time.
Faster rates for the Frank-Wolfe method over strongly-convex sets
D. Garber and E. Hazan · 2015
Closest in time.
Barrier Frank-Wolfe for marginal inference
R. G. Krishnan, S. Lacoste-Julien, and D. Sontag · 2015
Closest in time.
A universal catalyst for first-order optimization
H. Lin, J. Mairal, and Z. Harchaoui · 2015
Closest in time.
On the von Neumann and Frank-Wolfe algorithms with away steps
J. Pena, D. Rodriguez, and N. Soheili · 2015
Closest in time.