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 -dimensional complex vector from its phaseless scalar products with 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 when for some . This is a step toward proving the conjecture in cite{Waldspurger2016}, which conjectures that the algorithm succeeds when . The analysis depends on an approach that enables the decoupling of the dependency between the algorithmic iterates and the sensing vectors.
Cited in
(8)- Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
- scientific article; zbMATH DE number 7295466 (Why is no real title available?)
- Phase Retrieval Algorithm via Nonconvex Minimization Using a Smoothing Function
- scientific article; zbMATH DE number 7255152 (Why is no real title available?)
- Solving phase retrieval via graph projection splitting
- Convolutional Phase Retrieval via Gradient Descent
- Optimization-Based AMP for Phase Retrieval: The Impact of Initialization and $\ell_{2}$ Regularization
- Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method
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)