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

2023/04/26 by Ying Lv, Wendi Bao, Lv, Ying +5
Computer Science · Mathematics · #Advanced Image Processing Techniques #Advanced Optimization Algorithms Research #FOS: Mathematics #Iterative Methods for Nonlinear Equations #Numerical Analysis (math.NA)

paper · pdf · doi:10.48550/arxiv.2304.13220

openalex publication_date 2023/04/26 · openalex created_date 2023/04/28 · openalex updated_date 2026/07/28

Abstract

In this paper, we construct a class of nonlinear greedy average block Kaczmarz methods to solve nonlinear problems without computing the Moore-Penrose pseudoinverse. This kind of methods adopts the average technique of Gaussian Kaczmarz method and combines with the greedy strategy, which greatly reduces the amount of computation. The convergence analysis and numerical experiments of the proposed method are given. The numerical results show the effectiveness of the proposed methods.

Related

• On convergence of greedy block nonlinear Kaczmarz methods with momentum
• On averaging block Kaczmarz methods for solving nonlinear systems of equations
• Greedy randomized sampling nonlinear Kaczmarz methods
• Greedy capped nonlinear Kaczmarz methods
• Random Greedy Fast Block Kaczmarz Method for Solving Large-Scale Nonlinear Systems