Date:	Tue, September 16, 2014
Time:	9:45
Place:	Research I Seminar Room

Abstract: Projection methods are iterative algorithms that use projections onto sets while relying on the general principle that when a family of sets is present, then projections onto the given individual sets are easier to perform than projections onto other sets (intersections, image sets under some transformation, etc.) that are derived from the given individual sets.

Their robustness, low computational effort and their ability to handle huge-size problems make them very useful for many convex real-world problems such as Image Reconstruction (IR) and Intensity-Modulated Radiation Therapy (IMRT) Treatment Planning.

Over the past decade, some projection methods have proven very effective also in some non-convex and discrete settings such as combinatorial games.

In this talk we describe several types of projection methods and illustrate their performances both for convex problems such as IR and IMRT, and also for non-convex problems such as the 8 queens puzzle and Sudoku.