Fixed-step Halpern iteration, and the new GHAL and AdaGHAL variants, provably solve fixed-point equations for contractive, nonexpansive, mildly expansive, and the newly defined gradually expansive class of operators at near-optimal oracle complexity.
Convergence of proximal splitting algorithms in CAT(κ) spaces and beyond.Fixed Point Theory and Algorithms for Sciences and Engineering, 2021(1):13,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Pushing the Complexity Boundaries of Fixed-Point Equations: Adaptation to Contraction and Controlled Expansion
Fixed-step Halpern iteration, and the new GHAL and AdaGHAL variants, provably solve fixed-point equations for contractive, nonexpansive, mildly expansive, and the newly defined gradually expansive class of operators at near-optimal oracle complexity.