How can we find a point in the intersection of two, or perhaps multiple, sets in a Euclidean space? A great variety of mathematical problems can be formulated this way, and we are going to discuss a general algorithmic strategy that applies to all of them: the method of alternating projections. The idea of the algorithm is very simple and consists in taking an initial guess and refining it by successively projecting the current iterate on one of the sets in an alternating fashion. We are going to consider several specific applications of the method, touch on the nuances of its theoretical analysis, and look at certain generalizations and modifications. In particular, we are going to talk about what happens when the projections are not exact, which is always the case in practical computations.
The simple and versatile method of alternating projections
17.01.2024 14:15 - 15:00
Organiser:
SFB 65
Location:
TU Wien, Wiedner Hauptstr. 8, grün DA 6A
Related Files
- pde_afternoon_2024-01-17.pdf 916 KB