On the global linear convergence of Frank-Wolfe optimization variants

Advances in Neural Information Processing Systems

Volumn 2015-January, Issue , 2015, Pages 496-504

  Lacoste Julien, Simon ^a   Jaggi, Martin ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; INFORMATION SCIENCE; LEARNING SYSTEMS; NUMBER THEORY;

CONDITION NUMBERS; CONVERGENCE RATES; GEOMETRIC QUANTITIES; LINEAR CONVERGENCE; MACHINE LEARNING APPLICATIONS; OPTIMIZATION ALGORITHMS; STRONG CONVEXITIES; SUBMODULAR OPTIMIZATIONS;

OPTIMIZATION;

EID: 84965135280     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (36)

1. S. D. Ahipaaoǧlu, P. Sun, and M. Todd. Linear convergence of a modified Frank-Wolfe algorithm for computing minimum-volume enclosing ellipsoids. Optimization Methods and Software, 23(1):5-19, 2008.
2. R. Alexander. The width and diameter of a simplex. Geometriae Dedicata, 6(1):87-94, 1977.
3. F. Bach. Learning with submodular functions: A convex optimization perspective. Foundations and Trends in Machine Learning, 6(2-3):145-373, 2013.
4. A. Beck and S. Shtern. Linearly convergent away-step conditional gradient for non-strongly convex functions. arXiv:1504.05002v1, 2015.
5. A. Beck and M. Teboulle. A conditional gradient method with linear rate of convergence for solving convex linear systems. Mathematical Methods of Operations Research (ZOR), 59(2):235-247, 2004.
6. M. D. Canon and C. D. Cullum. A tight upper bound on the rate of convergence of Frank-Wolfe algorithm. SIAM Journal on Control, 6(4):509-516, 1968.
7. V. Chari et al. On pairwise costs for network flow multi-object tracking. In CVPR, 2015.
8. J. C. Dunn. Rates of convergence for conditional gradient algorithms near singular and nonsingular extremals. SIAM Journal on Control and Optimization, 17(2):187-211, 1979.
9. M. Frank and P. Wolfe. An algorithm for quadratic programming. Naval Research Logistics Quarterly, 3:95-110, 1956.
10. D. Garber and E. Hazan. A linearly convergent conditional gradient algorithm with applications to online and stochastic optimization. arXiv:1301.4666v5, 2013.
11. D. Garber and E. Hazan. Faster rates for the Frank-Wolfe method over strongly-convex sets. In ICML, 2015.
12. J. Guélat and P. Marcotte. Some comments on Wolfe's 'away step'. Mathematical Programming, 1986.
13. D. Hearn, S. Lawphongpanich, and J. Ventura. Restricted simplicial decomposition: Computation and extensions. In Computation Mathematical Programming, volume 31, pages 99-118. Springer, 1987.
14. C. A. Holloway. An extension of the Frank and Wolfe method of feasible directions. Mathematical Programming, 6(1):14-27, 1974.
15. M. Jaggi. Revisiting Frank-Wolfe: Projection-free sparse convex optimization. In ICML, 2013.
16. A. Joulin, K. Tang, and L. Fei-Fei. Efficient image and video co-localization with Frank-Wolfe algorithm. In ECCV, 2014.
17. V. Kolmogorov and R. Zabin. What energy functions can be minimized via graph cuts? IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(2):147-159, 2004.
18. R. G. Krishnan, S. Lacoste-Julien, and D. Sontag. Barrier Frank-Wolfe for marginal inference. In NIPS, 2015.
19. P. Kumar and E. A. Yildirim. A linearly convergent linear-time first-order algorithm for support vector classification with a core set result. INFORMS Journal on Computing, 2010.
20. S. Lacoste-Julien and M. Jaggi. An affine invariant linear convergence analysis for Frank-Wolfe algorithms. arXiv:1312.7864v2, 2013.
21. S. Lacoste-Julien, M. Jaggi, M. Schmidt, and P. Pletscher. Block-coordinate Frank-Wolfe optimization for structural SVMs. In ICML, 2013.
22. G. Lan. The complexity of large-scale convex programming under a linear optimization oracle. arXiv:1309.5550v2, 2013.
23. E. S. Levitin and B. T. Polyak. Constrained minimization methods. USSR Computational Mathematics and Mathematical Physics, 6(5):787-823, Jan. 1966.
24. H. Lin, J. Mairal, and Z. Harchaoui. A universal catalyst for first-order optimization. In NIPS, 2015.
25. B. Mitchell, V. F. Demyanov, and V. Malozemov. Finding the point of a polyhedron closest to the origin. SIAM Journal on Control, 12(1), 1974.
26. R. Nãnculef, E. Frandi, C. Sartori, and H. Allende. A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training. Information Sciences, 2014.
27. Y. Nesterov. Introductory Lectures on Convex Optimization. Kluwer Academic Publishers, 2004.
28. J. Pena, D. Rodriguez, and N. Soheili. On the von Neumann and Frank-Wolfe algorithms with away steps. arXiv:1507.04073v2, 2015.
29. J. C. Platt. Fast training of support vector machines using sequential minimal optimization. In Advances in kernel methods: support vector learning, pages 185-208. 1999.
30. S. M. Robinson. Generalized Equations and their Solutions, Part II: Applications to Nonlinear Programming. Springer, 1982.
31. B. Von Hohenbalken. Simplicial decomposition in nonlinear programming algorithms. Mathematical Programming, 13(1):49-68, 1977.
32. M. J. Wainwright and M. I. Jordan. Graphical models, exponential families, and variational inference. Foundations and Trends in Machine Learning, 1(12):1-305, 2008.
33. P.-W. Wang and C.-J. Lin. Iteration complexity of feasible descent methods for convex optimization. Journal of Machine Learning Research, 15:1523-1548, 2014.
34. P. Wolfe. Convergence theory in nonlinear programming. In Integer and Nonlinear Programming. 1970.
35. P. Wolfe. Finding the nearest point in a polytope. Mathematical Programming, 11(1):128-149, 1976.
36. G. M. Ziegler. Lectures on 0/1-polytopes. arXiv:math/9909177v1, 1999.