skip to content

Alternating projections for phase retrieval with random sensing vectors

Presented by: 
Irene Waldspurger
Friday 3rd November 2017 - 09:00 to 09:50
INI Seminar Room 1
Phase retrieval consists in reconstructing an unknown element in a complex vector space from the modulus of linear measurements. The first reconstruction algorithms for which theoretical guarantees could be proven relied on convexification techniques. It has only recently been realized that similar guarantees hold for non-convex local search methods, that are faster and simpler, provided that their starting point is carefully chosen. We will explain how to establish these guarantees for the most well-known local search method: alternating projections. We will also discuss the role of the initialization method.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons