• DOI:10.1109/ITA.2018.8503171
• Corpus ID: 52082993

Phase Retrieval Using Alternating Minimization in a Batch Setting

@article{Zhang2018PhaseRU,
  title={Phase Retrieval Using Alternating Minimization in a Batch Setting},
  author={Teng Zhang},
  journal={2018 Information Theory and Applications Workshop (ITA)},
  year={2018},
  pages={1-17}
}

• Teng Zhang
• Published 25 June 2017
• Computer Science
• 2018 Information Theory and Applications Workshop (ITA)

This paper considers the problem of phase retrieval, where the goal is to recover a signal $z\in {\mathbb{c}}^n$ from the observations ${y}_{i}=\vert{a}_{i}^\ast{z}\vert, {i}=1,2,\ldots,{m}$. While many algorithms have been proposed, the alternating minimization algorithm has been one of the most commonly used methods, and it is very simple to implement. Current work [26] has proved that when the observation vectors $\{{a}_{i}\}_{i=1}^{m}$ are sampled from a complex Gaussian distribution $N(\mathrm{0}, \mathbf{I})$, it recovers the underlying signal with a good initialization when ${m}=O({n})$, or with random initialization when ${m}=O({n}^{2})$, and it conjectured that random initialization succeeds with ${m}=O({n})$. This work proposes a modified alternating minimization method in a batch setting, and proves that when ${m}=O({n}{log^{3}n})$, the proposed algorithm with random initialization recovers the underlying signal with high probability. The proof is based on the observation that after each iteration of alternating minimization, with high probability, the angle between the estimated signal and the underlying signal is reduced.