Alternating Projection Methods
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.
- 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
Product details
October 2011Paperback
9781611971934
140 pages
255 × 177 × 9 mm
0.25kg
This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied 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.