Metraipolis › archive › dc_c81b350ae2cd
Two-point residual step size gradient methods for linear systems — arXiv:2611.02743
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.02743
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:46:26.090Z
- SHA-256 of the archived text
434033d52f8a75f7d218db5af464b3d5d3a840f0c7c0104c87c794bb1a3f64e3- Stable URL of this page
https://metraipolis.com/documento/dc_c81b350ae2cd
How to cite
Two-point residual step size gradient methods for linear systems — arXiv:2611.02743 — arXiv (en), https://arxiv.org/abs/2611.02743 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c81b350ae2cd (Metraipolis archive dc_c81b350ae2cd, sha256 434033d52f8a75f7d218db5af464b3d5d3a840f0c7c0104c87c794bb1a3f64e3)
BibTeX
@misc{dcc81b350ae2cd,
title = {Two-point residual step size gradient methods for linear systems — arXiv:2611.02743},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.02743},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c81b350ae2cd; sha256 434033d52f8a75f7d218db5af464b3d5d3a840f0c7c0104c87c794bb1a3f64e3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02743. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Kaczmarz-type methods often converge slowly when the coefficient matrix is ill-conditioned. In particular, when the smallest singular value is small, every row of the coefficient matrix is nearly orthogonal to the corresponding right singular direction, so that the iteration stalls along that direction. To break this slow-convergence regime, we borrow the delayed-step-size idea of the Barzilai-Borwein (BB) method and, within the framework of the residual-based surrogate-hyperplane Kaczmarz method, propose two new step sizes for gradient-descent-type methods solving linear systems: a delayed residual step size \(\alpha_k^{\mathrm{DR}}\) and a residual-difference step size \(\alpha_k^{\mathrm{RD}}\), which correspond, respectively, to the BB1 and BB2 step sizes in convex quadratic optimization. We prove that \(\alpha_k^{\mathrm{RD}}\le\alpha_k^{\mathrm{DR}}\), and we analyze the convergence of the resulting method in a canonical model with two singular values: although the step sizes are non-monotone, the residual norm is shown to decrease after finitely many steps. Numerical experiments on some ill-conditioned linear systems illustrate the effectiveness of the proposed methods.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Numerical Analysis (math.NA) ; Dynamical Systems (math.DS); Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2611.02743 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:14:37.816Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).