V. Cevher, S. Becker, and M. Schmidt, Convex Optimization for Big Data: Scalable, randomized, and parallel algorithms for big data analytics, IEEE Signal Processing Magazine, vol.31, issue.5, pp.32-43, 2014.
DOI : 10.1109/MSP.2014.2329397

E. Candes and T. Tao, Decoding by Linear Programming, IEEE Transactions on Information Theory, vol.51, issue.12, pp.4203-4215, 2005.
DOI : 10.1109/TIT.2005.858979
URL : http://arxiv.org/abs/math/0502327

J. Langford, L. Li, and T. Zhang, Sparse online learning via truncated gradient, 2009.

P. L. Combettes and V. R. Wajs, Signal Recovery by Proximal Forward-Backward Splitting, Multiscale Modeling & Simulation, vol.4, issue.4, pp.1168-1200, 2005.
DOI : 10.1137/050626090
URL : https://hal.archives-ouvertes.fr/hal-00017649

N. L. Roux, M. Schmidt, and F. R. Bach, A stochastic gradient method with an exponential convergence rate for finite training sets, NIPS, pp.2663-2671, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00674995

L. Rosasco, S. Villa, and B. C. Vu, Convergence of Stochastic Proximal Gradient Algorithm ArXiv e-prints, 2014.

A. Beck and M. Teboulle, A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems, SIAM Journal on Imaging Sciences, vol.2, issue.1, pp.183-202, 2009.
DOI : 10.1137/080716542
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.231.3271

S. S. Ram, A. Nedic, and V. V. Veeravalli, A new class of distributed optimization algorithms : application to regression of distributed data, pp.37-41, 2012.

W. Shi, Q. Ling, G. Wu, and W. Yin, A Proximal Gradient Algorithm for Decentralized Composite Optimization, IEEE Transactions on Signal Processing, vol.63, issue.22, pp.1-11, 2015.
DOI : 10.1109/TSP.2015.2461520

G. Scutari, F. Facchinei, P. Song, D. P. Palomar, and J. Pang, Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems, IEEE Transactions on Signal Processing, vol.62, issue.3, pp.641-656, 2014.
DOI : 10.1109/TSP.2013.2293126

T. Chang, A. Nedic, and A. Scaglione, Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method, IEEE Transactions on Automatic Control, vol.59, issue.6, pp.1524-1538, 2014.
DOI : 10.1109/TAC.2014.2308612
URL : http://arxiv.org/abs/1304.5590

M. Frank and P. Wolfe, An algorithm for quadratic programming, Naval Research Logistics Quarterly, vol.3, issue.1-2, 1956.
DOI : 10.1002/nav.3800030109

H. Ouyang and A. Gray, Fast stochastic frank-wolfe algorithms for non-linear svms, SDM -SIAM International Confernce on Data Mining, 2010.

F. R. Bach, Learning with Submodular Functions: A Convex Optimization Perspective, Machine Learning, pp.145-373, 2013.
DOI : 10.1561/2200000039
URL : https://hal.archives-ouvertes.fr/hal-00645271

M. Fukushima, A modified Frank-Wolfe algorithm for solving the traffic assignment problem, Transportation Research Part B: Methodological, vol.18, issue.2, pp.169-177, 1984.
DOI : 10.1016/0191-2615(84)90029-8

M. Dudk, Z. Harchaoui, and J. Malick, Lifted coordinate descent for learning with trace-norm regularization, AISTATS, 2012.

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

R. M. Freund and P. Grigas, New analysis and results for the frankwolfe method ArXiv e-prints, 2013.

A. Bellet, Y. Liang, A. B. Garakani, M. Balcan, and F. Sha, A Distributed Frank-Wolfe Algorithm for Communication-Efficient Sparse Learning, pp.1-19, 2014.
DOI : 10.1137/1.9781611974010.54
URL : https://hal.archives-ouvertes.fr/hal-01430851

M. Jaggi, V. Smith, J. Takac, S. Terhorst, T. Krishnan et al., Communication-efficient distributed dual coordinate ascent, NIPS, 2014.

D. Palomar and M. Chiang, A tutorial on decomposition methods for network utility maximization, IEEE Journal on Selected Areas in Communications, vol.24, issue.8, pp.1439-1451, 2006.
DOI : 10.1109/JSAC.2006.879350
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.5361

J. Lafond, H. Wai, and E. Moulines, Convergence analysis of a stochastic projection-free algorithm ArXiv e-prints, P. Massart, Concentration Inequalities and Model Selection, 2003.

A. G. Dimakis, S. Kar, J. M. Moura, M. G. Rabbat, and A. Scaglione, Gossip Algorithms for Distributed Signal Processing, Proc. IEEE, pp.1847-1864, 2010.
DOI : 10.1109/JPROC.2010.2052531

L. Xiao and S. Boyd, Fast linear iterations for distributed averaging, Systems & Control Letters, vol.53, issue.1, pp.65-78, 2004.
DOI : 10.1016/j.sysconle.2004.02.022
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.7284

S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, Randomized gossip algorithms, IEEE Transactions on Information Theory, vol.52, issue.6, pp.2508-2530, 2006.
DOI : 10.1109/TIT.2006.874516
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.8625

R. A. Horn and C. R. Johnson, Topics in matrix analysis, 1994.
DOI : 10.1017/CBO9780511840371