PreprintarXiv licencearXiv
Acceleration of the Method of Alternating Projections on subspaces by GMRES
Abstract
In this paper we propose a GMRES-accelerated version of the Method of Alternating Projections (MAP) for subspaces. It is proved that the accelerated version not only converges to a feasible solution, but also solves a best approximation problem. Comparisons are made with other accelerations proposed in the literature, for solving saddle point problems.
Related
- Polynomial Acceleration of Alternating Projections: Chebyshev Acceleration, Convergence Rates, and Retractions
- An Equivalence result for sketched Anderson Acceleration and sketched GMRES
- A Unified Two-Grid Framework for Anderson Acceleration and Nonlinear GMRES
- Projections and minimal invariant subspaces in the Hardy space over the bidisk
- Deeply unrolled alternating projections for phase retrieval
BibTeX
@misc{hernandezramos2026acceleration,
title = {{Acceleration of the Method of Alternating Projections on subspaces by GMRES}},
author = {Luis Manuel Hernández-Ramos and Maryam Calles-Cabriles and Gorka Emaldi-Porco},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.36938},
eprint = {2610.36938},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.36938},
}
RIS
TY - UNPB
TI - Acceleration of the Method of Alternating Projections on subspaces by GMRES
AU - Luis Manuel Hernández-Ramos
AU - Maryam Calles-Cabriles
AU - Gorka Emaldi-Porco
PY - 2026
DA - 2026/10/27
PB - arXiv
DO - 10.48550/arxiv.2610.36938
UR - https://arxiv.org/abs/2610.36938
AB - In this paper we propose a GMRES-accelerated version of the Method of Alternating Projections (MAP) for subspaces. It is proved that the accelerated version not only converges to a feasible solution, but also solves a best approximation problem. Comparisons are made with other accelerations proposed in the literature, for solving saddle point problems.
ER -