New Analysis and Results for the Frank-Wolfe Method

M. Frank and P. Wolfe, An algorithm for quadratic programming , Naval Research Logistics Quarterly 3

1956

Earlier work this paper cites.

E. Levitin and B. Polyak, Constrained minimization methods , USSR Computational Mathematics and Mathematical Physics 6

1966

Earlier work this paper cites.

V. Demyanov and A. Rubinov, Approximate methods in optimization problems , American Elsevier Publishing Co., New York, 1970

1970

Earlier work this paper cites.

J. Dunn and S. Harshbarger, Conditional gradient algorithms with open loop step size rules , Journal of Mathematical Analysis and Applications 62

1978

Earlier work this paper cites.

J. Dunn, Rates of convergence for conditional gradient algorithms near singular and nonsinglular extremals , SIAM Journal on Control and Optimization 17

1979

Earlier work this paper cites.

J. Dunn, Convergence rates for conditional gradient sequences generated by implicit step length rules , SIAM Journal on Control and Optimization 18

1980

Earlier work this paper cites.

D. Hearn, The gap function of a convex program , Operations Research Letters 1

1982

Earlier work this paper cites.

B. Polyak, Introduction to optimization , Optimization Software, Inc., New York, 1987

1987

Earlier work this paper cites.

L. Khachiyan, Rounding of polytopes in the real number model of computation , Mathematics of Operations Research 21

1996

Earlier work this paper cites.

Y.E. Nesterov, Introductory lectures on convex optimization: a basic course , Applied Optimization, vol. 87, Kluwer Academic Publishers, Boston, 2003

2003

Cited alongside, same era.

Y.E. Nesterov, Smooth minimization of non-smooth functions , Mathematical Programming 103

2005

Cited alongside, same era.

A. Nemirovski, private communication , (2007)

2007

Cited alongside, same era.

K.L. Clarkson, Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm , 19th ACM-SIAM Symposium on Discrete Algorithms (2008), 922–931

2008

Cited alongside, same era.

A. d’Aspremont, Smooth optimization with approximate gradient , SIAM Journal on Optimization 19

2008

Cited alongside, same era.

J. Giesen, M. Jaggi, and S. Laue, Optimizing over the growing spectrahedron , ESA 2012: 20th Annual European Symposium on Algorithms (2012)

2012

Later among the works it cites.

V. Temlyakov, Greedy approximation in convex optimization , Tech. report, University of South Carolina, 2012

Original

2012

Later among the works it cites.

O. Devolder, F. Glineur, and Y.E. Nesterov, First-order methods of smooth convex optimization with inexact oracle , Tech. report, CORE, Louvain-la-Neuve, Belgium, 2013

2013

Closest in time.

Z. Harchaoui, A. Juditsky, and A. Nemirovski, Conditional gradient algorithms for norm-regularized smooth convex optimization , Technical R

2013

Closest in time.

M. Jaggi, Revisiting Frank-Wolfe: Projection-free sparse convex optimization , Proceedings of the 30th International Conference on Machine Learning (ICML-13), 2013, pp. 427–435