Skip to content
DraconiticResearch
Search Sources API
186,625 studies31 sourcesUpdated 19 min ago
PreprintarXiv licencearXiv

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

  • Wendi Bao
  • Jing Li
  • Lili Xing
  • Weiguo Li
Open at sourcePDFDOICite

Abstract

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.

Related

  1. Uniqueness of positive solutions of double-power nonlinear stationary Schrödinger equations: the fixed frequency case and the fixed mass case
    Linjie Song, Wenming Zou
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  2. A Bregman proximal linearized ADMM for fractional programming with nonlinear coupling constraints
    Pengjie Liu, Jinhu Chen, Minh N. Dao +2
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. One-dimensional pressureless flow with a nonlinear velocity law: Bregman variational construction and well-posedness
    Gaowei Cao, Feimin Huang, Guirong Tang
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  4. Measurement Error and Nonlinear Confounding: Structural Equation Modeling Versus Double Machine Learning
    Eunjeong Song, Sehee Hong
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. Uniqueness of Bound States for Double-Power Scalar Field Equations
    Yujin Guo, Wei Ji, Yong Luo
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv

Cite

BibTeXRIS
BibTeX
@misc{bao2026greedy,
  title = {{A greedy double-block nonlinear Bregman-Kaczmarz method for nonlinear equations}},
  author = {Wendi Bao and Jing Li and Lili Xing and Weiguo Li},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.15676},
  eprint = {2610.15676},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.15676},
}
RIS
TY  - UNPB
TI  - A greedy double-block nonlinear Bregman-Kaczmarz method for nonlinear equations
AU  - Wendi Bao
AU  - Jing Li
AU  - Lili Xing
AU  - Weiguo Li
PY  - 2026
DA  - 2026/10/11
PB  - arXiv
DO  - 10.48550/arxiv.2610.15676
UR  - https://arxiv.org/abs/2610.15676
AB  - 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.
ER  -