Greedy capped nonlinear Kaczmarz methods

Abstract: To solve nonlinear problems, we construct two kinds of greedy capped nonlinear Kaczmarz methods by setting a capped threshold and introducing an effective probability criterion for selecting a row of the Jacobian matrix. The capped threshold and probability criterion are mainly determined by the maximum residual and maximum distance rules. The block versions of the new methods are also presented. We provide the convergence analysis of these methods and their numerical results behave quite well.