Best Approximation Algorithms
Best approximation algorithms were already discussed in Corollary 5.28, in Example 27.17, and in Example 27.18. In this chapter we provide further approaches for computing the projection onto the intersection of finitely many closed convex sets, employing the individual projectors, namely, Dykstra’s algorithm and Haugazeau’s algorithm. Applications of the latter to solving monotone inclusion and minimization problems with strongly convergent algorithms are given.
KeywordsApproximation Algorithm Monotone Operator Nonempty Close Convex Subset Individual Projector Closed Convex Cone
Unable to display preview. Download preview PDF.