Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees
From MaRDI portal
Publication:3460425
DOI10.2168/LMCS-11(4:20)2015zbMath1351.03054arXiv1506.05127OpenAlexW2278644336MaRDI QIDQ3460425
Publication date: 7 January 2016
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.05127
Constructive and recursive analysis (03F60) Fixed-point theorems (47H10) Complexity of computation (including implicit computational complexity) (03D15) Functionals in proof theory (03F10) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (25)
Quantitative analysis of a subgradient-type method for equilibrium problems ⋮ Revisiting jointly firmly nonexpansive families of mappings ⋮ The Brouwer Fixed Point Theorem Revisited ⋮ Abstract strongly convergent variants of the proximal point algorithm ⋮ Realizing semicomputable simplices by computable dynamical systems ⋮ On Korpelevich's extragradient algorithm ⋮ Quantitative results on Fejér monotone sequences ⋮ On computational properties of Cauchy problems generated by accretive operators ⋮ Strong Convergence for the Alternating Halpern–Mann Iteration in CAT(0) Spaces ⋮ Rates of convergence for iterative solutions of equations involving set-valued accretive operators ⋮ On modified Halpern and Tikhonov-Mann iterations ⋮ The finitary content of sunny nonexpansive retractions ⋮ Unnamed Item ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 ⋮ Quantitative results on a Halpern-type proximal point algorithm ⋮ Unnamed Item ⋮ Connected choice and the Brouwer fixed point theorem ⋮ Quantitative translations for viscosity approximation methods in hyperbolic spaces ⋮ Moduli of regularity and rates of convergence for Fejér monotone sequences ⋮ A new metastable convergence criterion and an application in the theory of uniformly convex Banach spaces ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Computability of Subsets of Metric Spaces ⋮ Weihrauch Complexity in Computable Analysis ⋮ On the proximal point algorithm and its Halpern-type variant for generalized monotone operators in Hilbert space
This page was built for publication: Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees