Abstract

Abstract In this chapter we present several iterative methods for the convex feasibility problem, aiming at a description of both the methods and some of the apparent connections between them. We start with the method of successive orthogonal projections (SOP) of Gubin, Polyak, and Raik, also known in recent literature on image recovery as the method of projections onto convex sets (POCS). As the names suggest, this method performs or thogonal projections successively onto the individual convex sets Qi (see Example 2.1.1); therefore, it is a sequential row-action algorithm, according to the classification in Section 1.3.

Full Text

Published Version

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.