PIMS Distinguished Speakers Series: Heinz Bauschke

Feasibility problems, i.e., finding a solution satisfying certain constraints, are common in mathematics and the natural sciences. If the constraints have simple projectors (nearest point mappings), then one popular approach to these problems is to use the projector sin some algorithmic fashion to approximate a solution. In this talk, I will survey three methods (alternating projections, Dykstra, and Douglas-Rachford), and comment on recent advances and remaining challenges.