Abstract

We report computer observations on the performance of an improved version of a simulated-annealing algorithm that was used before for the problem of phase retrieval. According to the results, we propose to use this method in conjunction with the algorithm of Fienup [ Opt. Lett. 3, 27 ( 1978); Opt. Eng. 18529, ( 1979); Appl. Opt. 21, 2758 ( 1982). The full power of the simulated-annealing algorithm with large arrays appears to be limited by present-day computers rather than by its numerical performance, but we believe that this combination may constitute an efficient method for phase retrieval.

© 1988 Optical Society of America

Probabilistic algorithm for phase retrieval

K. A. Marsh and J. M. Richardson
J. Opt. Soc. Am. A 5(7) 993-998 (1988)

Phase retrieval from experimental far-field intensity data

M. J. Pérez-Ilzarbe, M. Nieto-Vesperinas, and R. Navarro
J. Opt. Soc. Am. A 7(3) 434-440 (1990)

Iterative blind deconvolution algorithm applied to phase retrieval

J. H. Seldin and J. R. Fienup
J. Opt. Soc. Am. A 7(3) 428-433 (1990)

Phase retrieval algorithms: a personal tour [Invited]

James R. Fienup
Appl. Opt. 52(1) 45-56 (2013)

Numerical investigation of the uniqueness of phase retrieval

J. H. Seldin and J. R. Fienup
J. Opt. Soc. Am. A 7(3) 412-427 (1990)