Abstract
Phase retrieval has been an attractive problem, and many algorithms have been proposed. Randomized Kaczmarz method is a fast iterative method with good performance in both convergence rate and computational cost with theoretical analysis. However, they all assume that the iteratively updated variables and the original data are independent, which is not true in reality. In this paper, we study for the first time the convergence analysis of this method in the real case, where only a finite number of measurements are available. Specifically, we theoretically prove the linear rate of convergence for the phase retrieval via randomized Kaczmarz algorithm without independence assumption.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
