GARLM: Greedy Autocorrelation Retrieval Levenberg–Marquardt Algorithm for Improving Sparse Phase Retrieval

Abstract

The goal of phase retrieval is to recover an unknown signal from the random measurements consisting of the magnitude of its Fourier transform. Due to the loss of the phase information, phase retrieval is considered as an ill-posed problem. Conventional greedy algorithms, e.g., greedy spare phase retrieval (GESPAR), were developed to solve this problem by using prior knowledge of the unknown signal. However, due to the defect of the Gauss–Newton method in the local convergence problem, especially when the residual is large, it is very difficult to use this method in GESPAR to efficiently solve the non-convex optimization problem. In order to improve the performance of the greedy algorithm, we propose an improved phase retrieval algorithm, which is called the greedy autocorrelation retrieval Levenberg–Marquardt (GARLM) algorithm. Specifically, the proposed GARLM algorithm is a local search iterative algorithm to recover the sparse signal from its Fourier transform magnitude. The proposed algorithm is preferred to existing greedy methods of phase retrieval, since at each iteration the problem of minimizing the objective function over a given support is solved by using the improved Levenberg–Marquardt (ILM) method and matrix transform. A local search procedure such as the 2-opt method is then invoked to get the optimal estimation. Simulation results are given to show that the proposed algorithm performs better than the conventional GESPAR algorithm.

An Improved Loss-Separation Method for Transformer Core Loss Calculation and Its Experimental Verification

“…In this paper, the Marquardt method combined with the general global optimization algorithm is adopted in the coefficient calculation and correction process [26]- [28]. The advantage of this algorithm is that it can reduce the requirements for initial value, improve the self-adaptability of correction, and thus improve the accuracy of nonlinear calculation.…”

Phase Retrieval for Radar Constant–Modulus Signal Design Based on the Bacterial Foraging Optimization Algorithm

“…Cheng X. proposed an iterative algorithm based on the majorization-minimization method for the joint design of transmit signal and receive filter for polarimetric radars, taking SINR as the objective function and energy constraint and similarity constraint as the constraint conditions [24], Wu L. L. further considered the constant-modulus constraint and proposed a method based on the alternating optimization and ADMM to solve the non-convex optimization problems [25]. In [26][27][28][29][30][31][32][33], Patton et al proposed a variety of time-domain constant-modulus signal synthesis algorithms according to different radar tasks and environments, such as error reduction algorithm (ERA) [26], fast gradient-based iterative algorithm [29], greedy autocorrelation retrieval Levenberg-Marquardt (GARLM) algorithm [30], and the weighted least-squares (WLS) algorithm [31]. In conclusion, the algorithm for synthesizing time-domain constant-modulus signals is extremely important and needs to be further supplemented.…”

Introduction of Fractal Based Information Processing and Recognition

“…The seventh article titled "GARLM: Greedy Autocorrelation Retrieval Levenberg-Marquardt Algorithm for Improving Sparse Phase Retrieval", authored by Guan Gui from College of Telecommunication and Information Engineering, Nanjing University of Posts and Telecommunications, China, proposed an improved phase retrieval algorithm, greedy autocorrelation retrieval Levenberg-Marquardt (GARLM) algorithm, to efficiently solve the non-convex optimization problem with large residual [16]. The GARLM algorithm was a local search iterative algorithm to recover the sparse signal from its Fourier transform magnitude, and the minimizing problem was solved by improved Levenberg-Marquardt (ILM) method.…”