Phase Retrieval via Incremental Truncated Wirtinger Flow

Abstract

In the phase retrieval problem, an unknown vector is to be recovered given quadratic measurements. This problem has received considerable attention in recent times. In this paper, we present an algorithm to solve a nonconvex formulation of the phase retrieval problem, that we call $\text{Incremental Truncated Wirtinger Flow}$. Given random Gaussian sensing vectors, we prove that it converges linearly to the solution, with an optimal sample complexity. We also provide stability guarantees of the algorithm under noisy measurements. Performance and comparisons with existing algorithms are illustrated via numerical experiments on simulated and real data, with both random and structured sensing vectors.

Cited by in corpus (9)

• Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
• Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind Deconvolution
• Complete Dictionary Recovery over the Sphere II: Recovery by Riemannian Trust-region Method
• Solving Large-scale Systems of Random Quadratic Equations via Stochastic Truncated Amplitude Flow
• Reshaped Wirtinger Flow and Incremental Algorithm for Solving Quadratic System of Equations
• Robust Wirtinger Flow for Phase Retrieval with Arbitrary Corruption
• Unfolded Algorithms for Deep Phase Retrieval
• Efficient phase retrieval based on dark fringe recognition with an ability of bypassing invalid fringes
• Solving Random Systems of Quadratic Equations with Tanh Wirtinger Flow