Greedy capped nonlinear Kaczmarz methods

by   Yanjun Zhang, et al.
Chongqing University

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.


Greedy randomized sampling nonlinear Kaczmarz methods

The nonlinear Kaczmarz method was recently proposed to solve the system ...

A class of pseudoinverse-free greedy block nonlinear Kaczmarz methods for nonlinear systems of equations

In this paper, we construct a class of nonlinear greedy average block Ka...

Greedy Motzkin-Kaczmarz methods for solving linear systems

The famous greedy randomized Kaczmarz (GRK) method uses the greedy selec...

On greedy multi-step inertial randomized Kaczmarz method for solving linear systems

Recently, the multi-step inertial randomized Kaczmarz (MIRK) method for ...

Block sampling Kaczmarz-Motzkin methods for consistent linear systems

The sampling Kaczmarz-Motzkin (SKM) method is a generalization of the ra...

Criterion for the resemblance between the mother and the model distribution

If the probability distribution model aims to approximate the hidden mot...

Convergence Guarantees for Deep Epsilon Greedy Policy Learning

Policy learning is a quickly growing area. As robotics and computers con...

Please sign up or login with your details

Forgot password? Click here to reset