QR-kod

Hybrid Iterative Methods for Convex Feasibility Problems and Fixed Point Problems of Relatively Nonexpansive Mappings in Banach Spaces

<p>Abstract</p> <p>The convex feasibility problem (CFP) of finding a point in the nonempty intersection <inline-formula> <graphic file="1687-1812-2008-583082-i1.gif"/></inline-formula> is considered, where <inline-formula> <graphic file="1687-1812-2008-583082-i2.gif"/></inline-formula> is an integer...

Full beskrivning

Sparad:
Bibliografiska uppgifter
Huvudupphov: Plubtieng Somyot, Ungchittrakool Kasamsuk
Materialtyp: Artigo
Språk:Inglês
Utgiven: SpringerOpen 2008-01-01
Serie:Fixed Point Theory and Applications
Länkar:http://www.fixedpointtheoryandapplications.com/content/2008/583082
Taggar: Lägg till en tagg
Inga taggar, Lägg till första taggen!