Phase Retrieval via Iterative Hard Thresholding Backtracking Algorithm

Abstract

In this paper, we study the problem of phase retrieval via an improved iterative hard thresholding (IHT) algorithm, which is called the backtracking-based iterative hard thresholding (BIHT) algorithm. By adding the idea of backtracking, BIHT optimizes the selection of the support in the iterative process of the algorithm. The IHT algorithm should start with a careful initialization, but the BIHT does not need to meet this requirement. In addition, BIHT overcomes the shortcoming of the instability of IHT, and improves the calculation time and accuracy. Under the reasonable assumption, we illustrate the effectiveness of the BIHT algorithm by several different experiments.