Approximate Solutions of Common Fixed-Point Problems

by Alexander J. Zaslavski

1.Introduction.- 2. Dynamic string-averaging methods in Hilbert spaces.- 3. Iterative methods in metric spaces.- 4. Dynamic string-averaging methods in normed spaces.- 5. Dynamic string-maximum methods in metric spaces.- 6. Spaces with generalized distances.- 7. Abstract version of CARP algorithm.- 8. Proximal point algorithm.- 9. Dynamic string-averaging proximal point algorithm.- 10. Convex feasibility problems.- 11. Iterative subgradient projection algorithm.- 12. Dynamic string-averaging subgradient projection algorithm.- References.- Index. 

466 pages, Paperback

Published July 4, 2016