Best Approximation Algorithms

  • Heinz H. Bauschke
  • Patrick L. Combettes
Part of the CMS Books in Mathematics book series (CMSBM)


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.


Approximation Algorithm Monotone Operator Nonempty Close Convex Subset Individual Projector Closed Convex Cone 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Mathematics Irving K. Barber SchoolUniversity of British ColumbiaKelownaCanada
  2. 2.Laboratoire Jacques-Louis LionsUniversité Pierre et Marie Curie - Paris 6ParisFrance

Personalised recommendations