Before revision: A sketching algorithm is a way to solve an optimization problem approximately and in a fraction of the usual time. We consider classical sketching algorithms which first  compress data by multiplication with a random "sketch matrix".
After revision: We consider sketching algorithms which first compress data by multiplication with a random "sketch matrix".