Home
My Books
Browse ▾
Recommendations
Choice Awards
Genres
Giveaways
New Releases
Lists
Explore
News & Interviews
Loading...
Community ▾
Groups
Quotes
Ask the Author
People
Sign in
Join
Jump to ratings and reviews
Want to Read
Shop this series
Rate this book
Algorithms for Solving Common Fixed Point Problems
Alexander J. Zaslavski
0.00
0 ratings
0 reviews
Want to Read
Shop this series
Rate this book
1. Introduction.- 2. Iterative methods in metric spaces.- 3. Dynamic string-averaging methods in normed spaces.- 4. Dynamic string-maximum methods in metric spaces.- 5. Abstract version of CARP algorithm.- 6. Proximal point algorithm.- 7. Dynamic string-averaging proximal point algorithm.- 8. Convex feasibility problems.
326 pages, Paperback
Published May 5, 2018
Book details & editions
1 person want to read
About the author
Alexander J. Zaslavski
52 books
Follow
Follow
Ratings
&
Reviews
What do
you
think?
Rate this book
Write a Review
Friends
&
Following
Create a free account
to discover what your friends think of this book!
Community Reviews
0.00
0 ratings
0 reviews
5 stars
0 (0%)
4 stars
0 (0%)
3 stars
0 (0%)
2 stars
0 (0%)
1 star
0 (0%)
Search review text
Filters
No one has reviewed this book yet.
Join the discussion
Add
a quote
Start
a discussion
Ask
a question
Can't find what you're looking for?
Get help and learn more about the design.
Help center