Solving systems of phaseless equations via Kaczmarz methods: a proof of concept study

DOI10.1088/0266-5611/31/12/125008zbMath1332.65045arXiv1502.01822MaRDI QIDQ3462579

Ke Wei

Publication date: 15 January 2016

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.01822

zbMATH Keywords

alternating projection; generalized phase retrieval; Kaczmarz methods; phase selection heuristic

Mathematics Subject Classification ID

65F20: Numerical solutions to overdetermined systems, pseudoinverses

65F22: Ill-posedness and regularization problems in numerical linear algebra

65F10: Iterative numerical methods for linear systems

Related Items

The Kaczmarz algorithm, row action methods, and statistical learning algorithms, Variational Phase Retrieval with Globally Convergent Preconditioned Proximal Algorithm, Строчно-ориентированная форма регуляризованного метода Качмажа, PhaseMax: Stable guarantees from noisy sub-Gaussian measurements, Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization, Stochastic projection methods and applications to some nonlinear inverse problems of phase retrieving, Fast rank-one alternating minimization algorithm for phase retrieval, Convergence rates of the Kaczmarz-Tanabe method for linear systems, Phase retrieval with PhaseLift algorithm, Phase retrieval for sub-Gaussian measurements, Conjugate phase retrieval in Paley-Wiener space, Riemannian optimization for phase retrieval from masked Fourier measurements, Guarantees of Riemannian optimization for low rank matrix completion, Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution, Fundamental limits of weak recovery with applications to phase retrieval, Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval, Sparse signal recovery from phaseless measurements via hard thresholding pursuit, Guarantees of Riemannian Optimization for Low Rank Matrix Recovery

Uses Software

• GESPAR
• PhaseLift
• PhaseCut
• Wirtinger Flow

Cites Work

• Unnamed Item
• Two-subspace projection method for coherent overdetermined systems
• Solving quadratic equations via phaselift when there are about as many equations as unknowns
• Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
• Limit of the smallest eigenvalue of a large dimensional sample covariance matrix
• Block-iterative methods for consistent and inconsistent linear equations
• Randomized Kaczmarz solver for noisy linear systems
• A randomized Kaczmarz algorithm with exponential convergence
• The rate of convergence for the method of alternating projections. II
• Paved with good intentions: analysis of a randomized block Kaczmarz method
• On signal reconstruction without phase
• An algebraic characterization of injectivity in phase retrieval
• Phase recovery, MaxCut and complex semidefinite programming
• Phase retrieval from coded diffraction patterns
• On the rate of convergence of the alternating projection method in finite dimensional spaces
• PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
• Randomized Extended Kaczmarz for Solving Least Squares
• Phase Retrieval via Wirtinger Flow: Theory and Algorithms
• Blind Deconvolution Using Convex Programming
• Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
• The method of alternating projections and the method of subspace corrections in Hilbert space
• Optical Wavefront Reconstruction: Theory and Numerical Methods
• GESPAR: Efficient Phase Retrieval of Sparse Signals
• Low-rank matrix completion using alternating minimization
• Phase Retrieval via Matrix Completion