N. Ahmed, T. Natarajan, and K. R. Rao, Discrete Cosine Transform, IEEE Transactions on Computers, vol.23, issue.1, pp.90-93, 1974.
DOI : 10.1109/T-C.1974.223784

R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows, 1993.

H. Akaike, Information theory and an extension of the maximum likelihood principle, Second International Symposium on Information Theory, pp.267-281, 1973.

F. Bach, Exploring large feature spaces with hierarchical multiple kernel learning, Advances in Neural Information Processing Systems (NIPS), 2008.
URL : https://hal.archives-ouvertes.fr/hal-00319660

F. Bach, R. Jenatton, J. Mairal, and G. Obozinski, Optimization with sparsity-inducing penalties. Foundation and Trends in Machine Learning, pp.1-106, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00613125

A. Barron, J. Rissanen, and B. Yu, The minimum description length principle in coding and modeling, IEEE Transactions on Information Theory, vol.44, issue.6, pp.2743-2760, 1998.
DOI : 10.1109/18.720554

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

E. Bernard, L. Jacob, J. Mairal, and J. Vert, Efficient RNA isoform identification and quantification from RNA-Seq data with network flows, Bioinformatics, vol.30, issue.17, 2013.
DOI : 10.1093/bioinformatics/btu317
URL : https://hal.archives-ouvertes.fr/hal-00803134

D. P. Bertsekas, Network Optimization: Continuous and Discrete Models, Athena Scientific, 1998.

T. Blumensath and M. E. Davies, Iterative hard thresholding for compressed sensing, Applied and Computational Harmonic Analysis, vol.27, issue.3, pp.265-274, 2009.
DOI : 10.1016/j.acha.2009.04.002

M. Boguñá, R. Pastor-satorras, and A. , Models of social networks based on social distance attachment, Physical Review E, vol.70, issue.5, p.56122, 2004.
DOI : 10.1103/PhysRevE.70.056122

S. P. Boyd and L. Vandenberghe, Convex Optimization, 2004.

Y. Boykov, O. Veksler, and R. Zabih, Fast approximate energy minimization via graph cuts, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.23, issue.11, pp.1222-1239, 2001.
DOI : 10.1109/34.969114
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.6806

A. Buades, B. Coll, and J. M. , A Review of Image Denoising Algorithms, with a New One, Multiscale Modeling & Simulation, vol.4, issue.2, p.490, 2005.
DOI : 10.1137/040616024
URL : https://hal.archives-ouvertes.fr/hal-00271141

V. Cehver, M. Duarte, C. Hedge, and R. G. Baraniuk, Sparse signal recovery using Markov random fields, Advances in Neural Information Processing Systems (NIPS), 2008.

A. Chambolle and J. Darbon, On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows, International Journal of Computer Vision, vol.40, issue.9, pp.288-307, 2009.
DOI : 10.1007/s11263-009-0238-9

S. S. Chen, D. L. Donoho, and M. A. Saunders, Atomic Decomposition by Basis Pursuit, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.33-61, 1999.
DOI : 10.1137/S1064827596304010

X. Chen, Q. Lin, S. Kim, J. Pena, J. G. Carbonell et al., Smoothing proximal gradient method for general structured sparse learning, Proceedings of the Twenty-Seven Conference on Uncertainty in Artificial Intelligence (UAI), 2011.

H. Y. Chuang, E. Lee, Y. T. Liu, D. Lee, and T. Ideker, Network-based classification of breast cancer metastasis, Molecular Systems Biology, vol.5, issue.140, 2007.
DOI : 10.1038/msb4100180

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2001.

C. Couprie, L. Grady, H. Talbot, and L. Najman, Combinatorial Continuous Maximum Flow, SIAM Journal on Imaging Sciences, vol.4, issue.3, pp.905-930, 2011.
DOI : 10.1137/100799186

T. M. Cover and J. Thomas, Elements of Information Theory, 2006.

K. Dabov, A. Foi, V. Katkovnik, and K. Egiazarian, Image Denoising by Sparse 3-D Transform-Domain Collaborative Filtering, IEEE Transactions on Image Processing, vol.16, issue.8, pp.2080-2095, 2007.
DOI : 10.1109/TIP.2007.901238

I. Daubechies, M. Defrise, and C. Mol, An iterative thresholding algorithm for linear inverse problems with a sparsity constraint, Communications on Pure and Applied Mathematics, vol.58, issue.11, pp.1413-1457, 2004.
DOI : 10.1002/cpa.20042

M. Elad and M. Aharon, Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries, IEEE Transactions on Image Processing, vol.15, issue.12, pp.3736-3745, 2006.
DOI : 10.1109/TIP.2006.881969
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.6477

J. Fan and R. Li, Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties, Journal of the American Statistical Association, vol.96, issue.456, pp.1348-1360, 2001.
DOI : 10.1198/016214501753382273

L. R. Ford and D. R. Fulkerson, Maximal flow through a network, Journal canadien de math??matiques, vol.8, issue.0, pp.399-404, 1956.
DOI : 10.4153/CJM-1956-045-5

P. Gleiser and L. Danon, Community structure in jazz Advances in Complex Systems, pp.565-573, 2003.

A. V. Goldberg, An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm, Journal of Algorithms, vol.22, issue.1, pp.1-29, 1997.
DOI : 10.1006/jagm.1995.0805

A. V. Goldberg and R. E. Tarjan, A new approach to the maximum flow problem, Proceedings of the ACM Symposium on Theory of Computing, 1986.

R. Guimerà, L. Danon, A. Díaz-guilera, F. Giralt, and A. Arenas, Self-similar community structure in a network of human interactions, Physical Review E, vol.68, issue.6, p.65103, 2003.
DOI : 10.1103/PhysRevE.68.065103

D. S. Hochbaum, Complexity and algorithms for nonlinear optimization??problems, Annals of Operations Research, vol.72, issue.3, pp.257-296, 2007.
DOI : 10.1007/s10479-007-0172-6

H. Hoefling, A Path Algorithm for the Fused Lasso Signal Approximator, Journal of Computational and Graphical Statistics, vol.19, issue.4, pp.984-1006, 2010.
DOI : 10.1198/jcgs.2010.09208

J. Huang, T. Zhang, and D. Metaxas, Learning with structured sparsity, Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09, pp.3371-3412, 2011.
DOI : 10.1145/1553374.1553429

D. R. Hunter and K. Lange, A tutorial on MM algorithms. The American Statistician, pp.30-37, 2004.

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

R. Jenatton, J. Audibert, and F. Bach, Structured variable selection with sparsity-inducing norms, Journal of Machine Learning Research, vol.12, pp.2777-2824, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00377732

D. J. Mackay, Information Theory, Inference, and Learning Algorithms, 2003.

J. Mairal, F. Bach, J. Ponce, G. Sapiro, and A. Zisserman, Non-local sparse models for image restoration, 2009 IEEE 12th International Conference on Computer Vision, 2009.
DOI : 10.1109/ICCV.2009.5459452

J. Mairal, F. Bach, J. Ponce, and G. Sapiro, Online learning for matrix factorization and sparse coding, Journal of Machine Learning Research, vol.11, pp.19-60, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00408716

J. Mairal, R. Jenatton, G. Obozinski, and F. Bach, Convex and network flow optimization for structured sparsity, Journal of Machine Learning Research, vol.12, pp.2649-2689, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00584817

S. Mallat and Z. Zhang, Matching pursuits with time-frequency dictionaries, IEEE Transactions on Signal Processing, vol.41, issue.12, pp.3397-3415, 1993.
DOI : 10.1109/78.258082

N. Meinshausen and P. Bühlmann, Stability selection, Journal of the Royal Statistical Society: Series B (Statistical Methodology), vol.7, issue.4, pp.417-473, 2010.
DOI : 10.1111/j.1467-9868.2010.00740.x

A. Nemirovsky and D. Yudin, Problem Complexity and Method Efficiency in Optimization, 1983.

Y. Nesterov, Gradient methods for minimizing composite objective function, CORE Discussion paper, 2007.

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

G. Obozinski and F. Bach, Convex relaxations for combinatorial penalties, 2012.

M. R. Osborne, B. Presnell, and B. A. Turlach, On the Lasso and its dual, Journal of Computational and Graphical Statistics, vol.9, issue.2, pp.319-356, 2000.

J. Portilla, V. Strela, M. J. Wainwright, and E. P. Simoncelli, Image denoising using scale mixtures of gaussians in the wavelet domain, IEEE Transactions on Image Processing, vol.12, issue.11, pp.1338-1351, 2003.
DOI : 10.1109/TIP.2003.818640

F. Rapaport, A. Zinovyev, M. Dutreix, E. Barillot, and J. Vert, Classification of microarray data using gene networks, BMC Bioinformatics, vol.8, issue.1, p.35, 2007.
DOI : 10.1186/1471-2105-8-35
URL : https://hal.archives-ouvertes.fr/hal-00433577

J. Rissanen, Modeling by shortest data description, Automatica, vol.14, issue.5, pp.465-471, 1978.
DOI : 10.1016/0005-1098(78)90005-5

M. Schmidt, N. L. Roux, and F. Bach, Convergence rates of inexact proximal-gradient methods for convex optimization, Advances in Neural Information Processing Systems (NIPS), 2011.
URL : https://hal.archives-ouvertes.fr/inria-00618152

G. Schwarz, Estimating the Dimension of a Model, The Annals of Statistics, vol.6, issue.2, pp.461-464, 1978.
DOI : 10.1214/aos/1176344136

R. Tibshirani, Regression shrinkage and selection via the Lasso, Journal of the Royal Statistical Society: Series B, vol.58, issue.1, pp.267-288, 1996.

B. A. Turlach, W. N. Venables, and S. J. Wright, Simultaneous Variable Selection, Technometrics, vol.47, issue.3, pp.349-363, 2005.
DOI : 10.1198/004017005000000139

M. H. Van-de and . Vijver, A Gene-Expression Signature as a Predictor of Survival in Breast Cancer, New England Journal of Medicine, vol.347, issue.25, pp.1999-2009, 2002.
DOI : 10.1056/NEJMoa021967

S. Wright, R. Nowak, and M. Figueiredo, Sparse Reconstruction by Separable Approximation, IEEE Transactions on Signal Processing, vol.57, issue.7, pp.2479-2493, 2009.
DOI : 10.1109/TSP.2009.2016892

M. Yuan and Y. Lin, Model selection and estimation in regression with grouped variables, Journal of the Royal Statistical Society: Series B (Statistical Methodology), vol.58, issue.1, pp.49-67, 2006.
DOI : 10.1198/016214502753479356

P. Zhao, G. Rocha, and B. Yu, The composite absolute penalties family for grouped and hierarchical variable selection, The Annals of Statistics, vol.37, issue.6A, pp.3468-3497, 2009.
DOI : 10.1214/07-AOS584

H. Zou and T. Hastie, Regularization and variable selection via the elastic net, Journal of the Royal Statistical Society: Series B (Statistical Methodology), vol.5, issue.2, pp.301-320, 2005.
DOI : 10.1073/pnas.201162998