Abstract The sketch-and-project, as a general archetypal algorithm for solving linear systems, unifies variety of randomized iterative methods such the Kaczmarz and coordinate descent. However, since it aims to find least-norm solution from system, sparse can not be included. This motivates us propose more framework, called sketched Bregman projection (SBP) method, in which we are able solution...