R. Jenatton, J. Audibert, and F. Bach, Structured variable selection with sparsity-inducing norms, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00377732

D. D. Lee and H. S. Seung, Learning the parts of objects by non-negative matrix factorization, Nature, vol.401, pp.788-791, 1999.

I. T. Jolliffe, N. T. Trendafilov, and M. Uddin, A Modified Principal Component Technique Based on the LASSO, Journal of Computational and Graphical Statistics, vol.12, issue.3, pp.531-547, 2003.
DOI : 10.1198/1061860032148

H. Zou, T. Hastie, and R. Tibshirani, Sparse Principal Component Analysis, Journal of Computational and Graphical Statistics, vol.15, issue.2, pp.265-286, 2006.
DOI : 10.1198/106186006X113430

D. M. Witten, R. Tibshirani, and T. Hastie, A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis, Biostatistics, vol.10, issue.3, 2009.
DOI : 10.1093/biostatistics/kxp008

L. Jacob, G. Obozinski, and J. P. 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

J. Huang, T. Zhang, and D. Metaxas, Learning with structured sparsity, Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09, 2009.
DOI : 10.1145/1553374.1553429
URL : http://arxiv.org/abs/0903.3002

A. Aspremont, F. Bach, and L. Ghaoui, Optimal solutions for sparse principal component analysis, Journal of Machine Learning Research, vol.9, pp.1269-1294, 2008.

B. Moghaddam, Y. Weiss, and S. Avidan, Spectral bounds for sparse PCA: Exact and greedy algorithms, Advances in Neural Information Processing Systems, p.915, 2006.

L. Mackey, Deflation methods for sparse pca, Advances in Neural Information Processing Systems 21, pp.1017-1024, 2009.

J. Mairal, F. Bach, J. Ponce, and G. Sapiro, Online dictionary learning for sparse coding, Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09, 2009.
DOI : 10.1145/1553374.1553463

H. Lee, A. Battle, R. Raina, and A. Y. Ng, Efficient sparse coding algorithms, Advances in Neural Information Processing Systems, pp.801-808, 2007.

A. P. Singh and G. J. Gordon, A Unified View of Matrix Factorization Models, Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases- Part II, pp.358-373, 2008.
DOI : 10.1007/978-3-540-87481-2_24

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

F. R. Chung, Spectral graph theory, 1997.
DOI : 10.1090/cbms/092

T. Zhang, Multi-stage convex relaxation for learning with sparse regularization, Advances in Neural Information Processing Systems, pp.1929-1936, 2008.

F. Bach, Consistency of the group Lasso and multiple kernel learning, Journal of Machine Learning Research, vol.9, pp.1179-1225, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00164735

C. A. Micchelli and M. Pontil, Learning the kernel function via regularization, Journal of Machine Learning Research, vol.6, issue.2, p.1099, 2006.

G. Obozinski, B. Taskar, and M. Jordan, Joint covariate selection and joint subspace selection for multiple classification problems, Statistics and Computing, vol.8, issue.68, 2009.
DOI : 10.1007/s11222-008-9111-x

D. P. Bertsekas, Nonlinear programming, Athena scientific, 1995.

A. M. Martinez and A. C. Kak, PCA versus LDA, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.23, issue.2, pp.228-233, 2001.
DOI : 10.1109/34.908974

E. Laine, A. Blondel, and T. E. Malliavin, Dynamics and Energetics: A Consensus Analysis of the Impact of Calcium on EF-CaM Protein Complex, Biophysical Journal, vol.96, issue.4, pp.1249-1263, 2009.
DOI : 10.1016/j.bpj.2008.10.055