A. Agarwal, S. Negahban, and M. J. Wainwright, Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions, The Annals of Statistics, vol.40, issue.2, pp.1171-1197, 2012.
DOI : 10.1214/12-AOS1000SUPP

A. Argyriou, M. Signoretto, and J. A. Suykens, Hybrid conditional gradient-smoothing algorithms with applications to sparse and low rank regularization, Regularization, Optimization, Kernels, and Support Vector Machines, pp.53-82, 2014.

F. Bach, Learning with Submodular Functions: A Convex Optimization Perspective, Foundations and Trends?? in Machine Learning, vol.6, issue.2-3, pp.145-373, 2013.
DOI : 10.1561/2200000039
URL : https://hal.archives-ouvertes.fr/hal-00645271

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

F. Bach, J. Mairal, and J. Ponce, Convex sparse matrix factorizations. arXiv preprint, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00345747

J. Bien, J. Taylor, and R. Tibshirani, A lasso for hierarchical interactions. The Annals of Statistics, pp.1111-1141, 2013.
DOI : 10.1214/13-aos1096
URL : http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4527358

K. Bredies, D. A. Lorenz, and P. Maass, A generalized conditional gradient method and its connection to an iterative shrinkage method, Computational Optimization and Applications, vol.104, issue.2, pp.173-193, 2009.
DOI : 10.1007/s10589-007-9083-3

E. J. Candès, X. Li, Y. Ma, W. , and J. , Robust principal component analysis?, Journal of the ACM, vol.58, issue.3, p.5811, 2011.
DOI : 10.1145/1970392.1970395

V. Chandrasekaran, B. Recht, P. A. Parrilo, and A. S. Willsky, The Convex Geometry of Linear Inverse Problems, Foundations of Computational Mathematics, vol.1, issue.10, pp.805-849, 2012.
DOI : 10.1007/s10208-012-9135-7

V. Chandrasekaran, S. Sanghavi, P. A. Parrilo, and A. S. Willsky, Rank-Sparsity Incoherence for Matrix Decomposition, SIAM Journal on Optimization, vol.21, issue.2, pp.572-596, 2011.
DOI : 10.1137/090761793
URL : http://arxiv.org/abs/0906.2220

C. Ding, T. Li, J. , and M. I. , Convex and semi-nonnegative matrix factorizations. Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol.32, issue.1, pp.45-55, 2010.
DOI : 10.1109/tpami.2008.277
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.3887

A. Forsgren, P. E. Gill, and E. Wong, Primal and dual active-set methods for convex quadratic programming, Mathematical Programming, pp.1-40, 2015.
DOI : 10.1007/s10589-014-9681-9:1-31
URL : http://arxiv.org/abs/1503.08349

R. Foygel, N. Srebro, and R. R. Salakhutdinov, Matrix reconstruction with the local max norm, Advances in Neural Information Processing Systems, pp.935-943, 2012.

J. Friedman, T. Hastie, and R. Tibshirani, Regularization Paths for Generalized Linear Models via Coordinate Descent, Journal of Statistical Software, vol.33, issue.1, p.1, 2010.
DOI : 10.18637/jss.v033.i01
URL : http://doi.org/10.18637/jss.v033.i01

Q. Gu, Z. Wang, and H. Liu, Low-rank and sparse structure pursuit via alternating minimization, Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, pp.600-609, 2016.

Z. Harchaoui, A. Juditsky, and A. Nemirovski, Conditional gradient algorithms for norm-regularized smooth convex optimization, Mathematical Programming, pp.75-112, 2015.
DOI : 10.1007/s10107-014-0778-9
URL : https://hal.archives-ouvertes.fr/hal-00978368

L. Jacob, G. Obozinski, and J. Vert, Group lasso with overlap and graph lasso, Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09, 2009.
DOI : 10.1145/1553374.1553431
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.7108

S. Lacoste-julien and M. Jaggi, On the global linear convergence of Frank-Wolfe optimization variants, Advances in Neural Information Processing Systems 28, pp.496-504, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01248675

J. Liu, P. Musialski, P. Wonka, Y. , and J. , Tensor completion for estimating missing values in visual data. Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol.35, issue.1, pp.208-220, 2013.

A. Maurer and M. Pontil, Structured sparsity and generalization, The Journal of Machine Learning Research, vol.13, issue.1, pp.671-690, 2012.

Y. Nesterov, Complexity bounds for primal-dual methods minimizing the model of objective function, Center for Operations Research and Econometrics, CORE Discussion Paper, 2015.

J. Nocedal and S. Wright, Numerical optimization, 2006.
DOI : 10.1007/b98874

G. Obozinski and F. Bach, A unified perspective on convex structured sparsity: Hierarchical, symmetric, submodular norms and beyond, p.1412385, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01412385

G. Obozinski, L. Jacob, and J. Vert, Group Lasso with overlaps: the Latent Group Lasso approach, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00628498

R. K. Pace and R. Barry, Sparse spatial autoregressions, Statistics & Probability Letters, vol.33, issue.3, pp.291-297, 1997.
DOI : 10.1016/S0167-7152(96)00140-X

Z. Qin, K. Scheinberg, and D. Goldfarb, Efficient block-coordinate descent algorithms for the Group Lasso, Mathematical Programming Computation, vol.67, issue.2, pp.143-169, 2013.
DOI : 10.1007/s12532-013-0051-x

N. Rao, P. Shah, W. , and S. , Forward–Backward Greedy Algorithms for Atomic Norm Regularization, IEEE Transactions on Signal Processing, vol.63, issue.21, pp.5798-5811, 2015.
DOI : 10.1109/TSP.2015.2461515

E. Fast-column-generation-for-atomic-norm-regularization-richard, G. R. Obozinski, and J. Vert, Tight convex relaxations for sparse matrix factorization, Advances in Neural Information Processing Systems, pp.3284-3292, 2014.

R. T. Rockafellar, Convex Analysis. Princeton landmarks in mathematics, 1997.

S. Shalev-shwartz and A. Tewari, Stochastic methods for l1-regularized loss minimization, Journal of Machine Learning Research, vol.12, pp.1865-1892, 2011.
DOI : 10.1145/1553374.1553493
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.325.5577

Y. She and H. Jiang, Group Regularized Estimation under Structural Hierarchy, Journal of the American Statistical Association, vol.34, issue.3, 2014.
DOI : 10.1111/j.1467-9868.2005.00503.x
URL : http://arxiv.org/abs/1411.4691

R. Tomioka and T. Suzuki, Convex tensor decomposition via structured Schatten norm regularization, Advances in Neural information Processing Systems, pp.1331-1339, 2013.

K. Wimalawarne, M. Sugiyama, and R. Tomioka, Multitask learning meets tensor factorization: task imputation via convex optimization, Advances in Neural Information Processing Systems 27, pp.2825-2833, 2014.

P. Wolfe, Finding the nearest point in A polytope, Mathematical Programming, vol.1, issue.1, pp.128-149, 1976.
DOI : 10.1007/BF01580381

X. Yan and J. Bien, Hierarchical sparse modeling: A choice of two regularizers. arXiv preprint, 2015.

Y. Yu, X. Zhang, and D. Schuurmans, Generalized conditional gradient for sparse estimation. arXiv preprint, 2014.

X. Zhang, D. Schuurmans, and Y. Liang-yu, Accelerated training for matrix-norm regularization: A boosting approach, Advances in Neural Information Processing Systems 25, pp.2906-2914, 2012.