Greedy randomized Bregman-Kaczmarz method for constrained nonlinear systems of equations
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909230043234304 |
|---|---|
| author | Xiao, Aqin Yin, Junfeng |
| author_facet | Xiao, Aqin Yin, Junfeng |
| contents | A greedy randomized nonlinear Bregman-Kaczmarz method by sampling the working index with residual information is developed for the solution of the constrained nonlinear system of equations. Theoretical analyses prove the convergence of the greedy randomized nonlinear Bregman-Kaczmarz method and its relaxed version. Numerical experiments verify the effectiveness of the proposed method,which converges faster than the existing nonlinear Bregman-Kaczmarz methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_16112 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Greedy randomized Bregman-Kaczmarz method for constrained nonlinear systems of equations Xiao, Aqin Yin, Junfeng Numerical Analysis A greedy randomized nonlinear Bregman-Kaczmarz method by sampling the working index with residual information is developed for the solution of the constrained nonlinear system of equations. Theoretical analyses prove the convergence of the greedy randomized nonlinear Bregman-Kaczmarz method and its relaxed version. Numerical experiments verify the effectiveness of the proposed method,which converges faster than the existing nonlinear Bregman-Kaczmarz methods. |
| title | Greedy randomized Bregman-Kaczmarz method for constrained nonlinear systems of equations |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2406.16112 |