Alternating Projection Methods
£45.99
Part of Fundamentals of Algorithms
- Authors:
- René Escalante, Universidad Simón Bolívar, Caracas
- Marcos Raydan, Universidad Simón Bolívar, Caracas
- Date Published: October 2011
- availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial null Mathematics for availability.
- format: Paperback
- isbn: 9781611971934
£
45.99
Paperback
Looking for an inspection copy?
This title is not currently available on inspection
-
This comprehensive textbook describes and analyzes all available alternating projection methods for solving the general problem of finding a point in the intersection of several given sets that belong to a Hilbert space. For each method, the authors describe and analyze the issues of convergence, speed of convergence, acceleration techniques, stopping criteria and applications. Different types of algorithms and applications are studied for subspaces, linear varieties and general convex sets. The authors also unify these algorithms in a common theoretical framework. Many examples and problems are included in order to reinforce student learning. This book can be used as a textbook for graduate or advanced undergraduate students. Because it is comprehensive, it can also be used as a tutorial or a reference by mathematicians and non-mathematicians from many fields of applications who need to solve alternating projection problems in their work.
Read more- Fully describes specific applications for which the alternating projection methods represent an efficient option
- An accessible contemporary source of information for both mathematicians and non-mathematicians working in the many fields of applications
- Several acceleration techniques are presented for every method, including some schemes that cannot be found in any other book
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: October 2011
- format: Paperback
- isbn: 9781611971934
- length: 140 pages
- dimensions: 255 x 177 x 9 mm
- weight: 0.25kg
- availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial null Mathematics for availability.
Table of Contents
Preface
1. Introduction
2. Overview on spaces
3. The MAP on subspaces
4. Row-action methods
5. Projecting on convex sets
6. Applications of MAP for matrix problems
Bibliography
Author index
Subject index.
Related Books
related journals
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×