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

Eike Neumann

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




Related Items (25)

Quantitative analysis of a subgradient-type method for equilibrium problemsRevisiting jointly firmly nonexpansive families of mappingsThe Brouwer Fixed Point Theorem RevisitedAbstract strongly convergent variants of the proximal point algorithmRealizing semicomputable simplices by computable dynamical systemsOn Korpelevich's extragradient algorithmQuantitative results on Fejér monotone sequencesOn computational properties of Cauchy problems generated by accretive operatorsStrong Convergence for the Alternating Halpern–Mann Iteration in CAT(0) SpacesRates of convergence for iterative solutions of equations involving set-valued accretive operatorsOn modified Halpern and Tikhonov-Mann iterationsThe finitary content of sunny nonexpansive retractionsUnnamed ItemMathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017Quantitative results on a Halpern-type proximal point algorithmUnnamed ItemConnected choice and the Brouwer fixed point theoremQuantitative translations for viscosity approximation methods in hyperbolic spacesModuli of regularity and rates of convergence for Fejér monotone sequencesA new metastable convergence criterion and an application in the theory of uniformly convex Banach spacesUnnamed ItemUnnamed ItemComputability of Subsets of Metric SpacesWeihrauch Complexity in Computable AnalysisOn 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