Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees

  • Eike Neumann
  • Published 2015 in Logical Methods in Computer Science


We study the computational difficulty of the problem of finding fixed points of nonexpansive mappings in uniformly convex Banach spaces. We show that the fixed point sets of computable nonexpansive self-maps of a nonempty, computably weakly closed, convex and bounded subset of a computable real Hilbert space are precisely the nonempty, co-r.e. weakly closed… (More)
DOI: 10.2168/LMCS-11(4:20)2015



Citations per Year

Citation Velocity: 11

Averaging 11 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.