Math & Computer Science
November 19, 2012
Friday - Nov. 30, 2012
1:00 to 1:50 p.m.
Title: An Invitation to Projection Models
Abstract: Feasibility problems, i.e., finding a solution satisfying certain constraints, are common in mathematics and the natural sciences. If the contraints have simple projectors (nearest point mappings), then one popular approach to these problems is to use the projectors in 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.
SOME REFRESHMENTS! EVERYONE WELCOME!
This notice is posted to the Event Calendar on the following dates: