In my presentation, I will develop the concept of « safe screening », a technique to reduce the dimensionality of large-scale optimization problems that exploits the sparsity of the solutions. I will first explain the fundamental ingredients of screening and highlight some recent advances in this field. In a second part, I will present how the concept of screening can be extended by exploiting partial knowledge about the solution of the optimization problem.