Phase Retrieval by Alternating Minimization With Random Initialization

From MaRDI portal



Abstract: We consider a phase retrieval problem, where the goal is to reconstruct a n-dimensional complex vector from its phaseless scalar products with m sensing vectors, independently sampled from complex normal distributions. We show that, with a random initialization, the classical algorithm of alternating minimization succeeds with high probability as n,mightarrowinfty when m/log3mgeqMn3/2log1/2n for some M>0. This is a step toward proving the conjecture in cite{Waldspurger2016}, which conjectures that the algorithm succeeds when m=O(n). The analysis depends on an approach that enables the decoupling of the dependency between the algorithmic iterates and the sensing vectors.













This page was built for publication: Phase Retrieval by Alternating Minimization With Random Initialization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124448)