A greedy double-block nonlinear Bregman-Kaczmarz method for nonlinear equations

In this paper, we develop a greedy double-block nonlinear Bregman-Kaczmarz method to efficiently find sparse solutions of nonlinear equations. The theoretical convergence rate of the proposed method is established under certain assumptions. Numerical experiments illustrate the competitive performance and superiority of the proposed method.