Metraipolis › archive › dc_695bac95207e
Finite Recovery by Extrapolation for the Douglas--Rachford Method on Affine Subspaces — arXiv:2611.02694
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.02694
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:45:39.776Z
- SHA-256 of the archived text
387eb7d15c4e90ca30de7447ac0af5b39aa15961d16b0e24a134f42390fabc38- Stable URL of this page
https://metraipolis.com/documento/dc_695bac95207e
How to cite
Finite Recovery by Extrapolation for the Douglas--Rachford Method on Affine Subspaces — arXiv:2611.02694 — arXiv (en), https://arxiv.org/abs/2611.02694 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_695bac95207e (Metraipolis archive dc_695bac95207e, sha256 387eb7d15c4e90ca30de7447ac0af5b39aa15961d16b0e24a134f42390fabc38)
BibTeX
@misc{dc695bac95207e,
title = {Finite Recovery by Extrapolation for the Douglas--Rachford Method on Affine Subspaces — arXiv:2611.02694},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.02694},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_695bac95207e; sha256 387eb7d15c4e90ca30de7447ac0af5b39aa15961d16b0e24a134f42390fabc38},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02694. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We completely describe the dynamics of the Douglas--Rachford (DR) method for solving affine subspace feasibility. We characterise the affine hull of the resulting iterates, and we show how the corresponding search space's dimension is an explicit function of the number of distinct nontrivial principal angles. This dimension can be much smaller than the ambient dimension, helping to explain why extrapolation can be so effective. Using this characterisation, we extend the Lyapunov surrogate method (LSM) to higher extrapolation orders and prove that it recovers the DR limit exactly from finitely many iterates. We show that LSM and a least-squares extrapolation (LeSE) share the affine search spaces used by the generalized minimal residual method (GMRES) applied to the DR fixed-point equation (DR-GMRES). The dimension characterisation gives bounds on the number of steps required for exact recovery by all three methods. We develop adaptive implementations that estimate the search-space dimension from differences between successive DR iterates and use this estimate to select the extrapolation order. Numerical experiments show how ill-conditioning affects recovery accuracy, and we identify cases where adaptive extrapolation runs faster than DR-GMRES. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno). Categorie arXiv: Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2611.02694 — 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.787Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).