F. Bach, Duality Between Subgradient and Conditional Gradient Methods, SIAM Journal on Optimization, vol.25, issue.1, 2015.
DOI : 10.1137/130941961
URL : https://hal.archives-ouvertes.fr/hal-00757696

F. Bach, R. Jenatton, J. Mairal, and G. Obozinski, Optimization with Sparsity-Inducing Penalties, Foundations and Trends?? in Machine Learning, vol.4, issue.1, pp.1-106, 2012.
DOI : 10.1561/2200000015
URL : https://hal.archives-ouvertes.fr/hal-00613125

H. H. Bauschke and P. L. Combettes, Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00643354

D. P. Bertsekas, Convex Optimization Algorithms, Athena Scientific, 2015.

H. Richard, P. Byrd, J. Lu, C. Nocedal, and . Zhu, A limited memory algorithm for bound constrained optimization, SIAM Journal on Scientific Computing, vol.16, issue.5, pp.1190-1208, 1995.

X. Chen, Q. Lin, S. Kim, G. Jaime, E. P. Carbonell et al., Smoothing proximal gradient method for general structured sparse regression, The Annals of Applied Statistics, vol.6, issue.2, pp.719-752, 2012.
DOI : 10.1214/11-AOAS514

B. Cox, A. Juditsky, and A. Nemirovski, Dual subgradient algorithms for large-scale nonsmooth learning problems, Mathematical Programming, pp.1-38, 2013.
DOI : 10.1007/s10107-013-0725-1
URL : https://hal.archives-ouvertes.fr/hal-00978358

M. Dudik, Z. Harchaoui, and J. Malick, Lifted coordinate descent for learning with trace-norm regularization, Proceedings of the 15th International Conference on Artificial Intelligence and Statistics (AISTATS), 2012.
URL : https://hal.archives-ouvertes.fr/hal-00756802

D. Garber and E. Hazan, A linearly convergent conditional gradient algorithm with applications to online and stochastic optimization, 2013.

Z. Harchaoui, A. Juditsky, and A. Nemirovski, Conditional gradient algorithms for normregularized smooth convex optimization, Mathematical Programming, pp.1-38, 2013.
DOI : 10.1007/s10107-014-0778-9
URL : https://hal.archives-ouvertes.fr/hal-00978368

E. Hazan and S. Kale, Projection-free online learning, ICML, 2012.

N. He, A. Juditsky, and A. Nemirovski, Mirror Prox algorithm for multi-term composite minimization and semi-separable problems, Computational Optimization and Applications, vol.2, issue.3???4, 2013.
DOI : 10.1007/s10589-014-9723-3
URL : https://hal.archives-ouvertes.fr/hal-01335905

M. Jaggi, Revisiting Frank-Wolfe: Projection-free sparse convex optimization, ICML, pp.427-435, 2013.

A. Juditsky and A. Nemirovski, Solving variational inequalities with monotone operators on domains given by linear minimization oracles. arXiv preprint arXiv:1312, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01335871

G. Lan, The complexity of large-scale convex programming under a linear optimization oracle. arXiv, 2013.

G. Lan and Y. Zhou, Conditional gradient sliding for convex optimization. arXiv, 2014.

C. Mu, Y. Zhang, J. Wright, and D. Goldfarb, Scalable Robust Matrix Recovery: Frank--Wolfe Meets Proximal Methods, SIAM Journal on Scientific Computing, vol.38, issue.5, 2014.
DOI : 10.1137/15M101628X
URL : http://arxiv.org/abs/1403.7588

A. Nemirovski, ) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems, SIAM Journal on Optimization, vol.15, issue.1, pp.229-251, 2004.
DOI : 10.1137/S1052623403425629

A. Nemirovski and S. Onn, Accuracy Certificates for Computational Problems with Convex Structure, Mathematics of Operations Research, vol.35, issue.1, pp.52-78, 2010.
DOI : 10.1287/moor.1090.0427
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.1116

Y. Nesterov, Smoothing Technique and its Applications in Semidefinite Optimization, Mathematical Programming, vol.16, issue.1, pp.245-259, 2007.
DOI : 10.1007/s10107-006-0001-8
URL : http://webdoc.sub.gwdg.de/ebook/serien/e/CORE/dp2004_73.pdf

Y. Nesterov, Smooth minimization of non-smooth functions, Mathematical Programming, vol.269, issue.1, pp.127-152, 2005.
DOI : 10.1007/s10107-004-0552-5

Y. Ouyang, Y. Chen, G. Lan, and E. P. Jr, An Accelerated Linearized Alternating Direction Method of Multipliers, SIAM Journal on Imaging Sciences, vol.8, issue.1, 2014.
DOI : 10.1137/14095697X

N. Parikh and S. Boyd, Proximal algorithms. Foundations and Trends in Optimization, pp.1-96, 2013.
DOI : 10.1561/2400000003

F. Pierucci, Z. Harchaoui, and J. Malick, A smoothing approach for composite conditional gradient with nonsmooth loss, Conférence dApprentissage Automatique?Actes CAP14, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01096630

M. Schmidt, N. L. Roux, and F. R. Bach, Convergence rates of inexact proximal-gradient methods for convex optimization, Adv. NIPS, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00618152

X. Zhang, Y. Yu, and D. Schuurmans, Accelerated training for matrix-norm regularization: A boosting approach, NIPS, 2012.