EUVIMEDEUVIMED entdecken
Crossref

On Dykstra’s algorithm with Bregman projections

Pedro Pinto, Nicholas Pischke

Zeitschrift für Analysis und ihre Anwendungen · 04.11.2026

DOI: 10.4171/zaa/1844 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Zeitschrift für Analysis und ihre Anwendungen, erschienen am 04.11.2026. Verfasst von Pedro Pinto und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We provide quantitative results on the asymptotic behavior of Dykstra’s algorithm with Bregman projections, a combination of the well-known Dykstra’s algorithm and the method of cyclic Bregman projections, designed to find best approximations and solve the convex feasibility problem in a non-orthogonal setting. The results we provide arise through the lens of proof mining, a program in mathematical logic which extracts computational information from non-effective proofs. Concretely, we provide a highly uniform and computable rate of metastability of low complexity and, moreover, we also specify general circumstances in which one can obtain full and effective rates of convergence, which, in particular, contain the case of polyhedra in Euclidean spaces. As a byproduct of our quantitative analysis, we also for the first time establish the strong convergence of Dykstra’s method with Bregman projections in suitable infinite-dimensional spaces.

Zitieren

APA

Pinto, P., & Pischke, N. (2026). On Dykstra’s algorithm with Bregman projections. Zeitschrift für Analysis und ihre Anwendungen. https://doi.org/10.4171/zaa/1844

Vancouver

Pinto P, Pischke N. On Dykstra’s algorithm with Bregman projections. Zeitschrift für Analysis und ihre Anwendungen. 2026. doi:10.4171/zaa/1844

BibTeX
@article{Pinto2026,
  author = {Pinto, Pedro and Pischke, Nicholas},
  title = {On Dykstra’s algorithm with Bregman projections},
  journal = {Zeitschrift für Analysis und ihre Anwendungen},
  year = {2026},
  doi = {10.4171/zaa/1844}
}
Kostenlos starten →