Phaseless Rcovery using Gauss-Newton Method
arXiv:1606.08135 · doi:10.1109/TSP.2017.2742981
Abstract
In this paper, we develop a concrete algorithm for phase retrieval, which we refer to as Gauss-Newton algorithm. In short, this algorithm starts with a good initial estimation, which is obtained by a modified spectral method, and then update the iteration point by a Gauss-Newton iteration step. We prove that a re-sampled version of this algorithm quadratically converges to the solution for the real case with the number of random measurements being nearly minimal. Numerical experiments also show that Gauss-Newton method has better performance over the other algorithms.
16 pages
References in corpus (1)
Cited by in corpus (16)
- Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind Deconvolution
- Solving Large-scale Systems of Random Quadratic Equations via Stochastic Truncated Amplitude Flow
- Perturbed Amplitude Flow for Phase Retrieval
- A Deterministic Theory for Exact Non-Convex Phase Retrieval
- Sparse Signal Recovery from Phaseless Measurements via Hard Thresholding Pursuit
- Sample-Efficient Sparse Phase Retrieval via Stochastic Alternating Minimization
- Phase Retrieval via Sparse Wirtinger Flow
- Recursive Importance Sketching for Rank Constrained Least Squares: Algorithms and High-order Convergence
- Spectral Method for Phase Retrieval: an Expectation Propagation Perspective
- Phase retrieval from the norms of affine transformations
- The estimation performance of nonlinear least squares for phase retrieval
- Solving Systems of Quadratic Equations via Exponential-type Gradient Descent Algorithm
- Phase retrieval for sub-Gaussian measurements
- Performance bound of the intensity-based model for noisy phase retrieval
- The recovery of complex sparse signals from few phaseless measurements
- Sharp global convergence guarantees for iterative nonconvex optimization: A Gaussian process perspective