Phase Retrieval via Linear Programming: Fundamental Limits and Algorithmic Improvements

R. W. Gerchberg, “A practical algorithm for the determination of phase from image and diffraction plane pictures,” Optik , vol. 35, p. 237, 1972

1972

Earlier work this paper cites.

J. R. Fienup, “Phase retrieval algorithms: a comparison,” Applied Optics , vol. 21, no. 15, pp. 2758–2769, 1982

1982

Earlier work this paper cites.

Y. Gordon, “Some inequalities for Gaussian processes and applications,” Israel Journal of Mathematics , vol. 50, no. 4, pp. 265–289, Dec 1985

1985

Earlier work this paper cites.

S. Boyd and L. Vandenberghe, Convex Optimization . Cambridge University Press, 2003

2003

Earlier work this paper cites.

K.-J. Miescke and F. Liese, Statistical Decision Theory: Estimation, Testing, and Selection . Springer New York, 2008

Original

2008

Earlier work this paper cites.

R. Balan, B. G. Bodmann, P. G. Casazza, and D. Edidin, “Painless reconstruction from magnitudes of frame coefficients,” Journal of Fourier Analysis and Applications , vol. 15, no. 4, pp. 488–501, 2009

2009

Earlier work this paper cites.

E. J. Candes, T. Strohmer, and V. Voroninski, “Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming,” Communications on Pure and Applied Mathematics , vol. 66, no. 8, pp. 1241–1274, 2013

2013

Earlier work this paper cites.

K. Jaganathan, S. Oymak, and B. Hassibi, “Sparse phase retrieval: Convex algorithms and limitations,” in Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on . IEEE, 2013, pp. 1022–1026

2013

Earlier work this paper cites.

P. Netrapalli, P. Jain, and S. Sanghavi, “Phase retrieval using alternating minimization,” in Advances in Neural Information Processing Systems , 2013, pp. 2796–2804

2013

Earlier work this paper cites.

M. Stojnic, “A framework to characterize performance of LASSO algorithms,” CoRR , vol. abs/1303.7291, 2013. [Online]. Available: http://arxiv.org/abs/1303.7291

Original

2013

Cited alongside, same era.

T. Goldstein, C. Studer, and R. Baraniuk, “A field guide to forward-backward splitting with a FASTA implementation,” arXiv eprint , vol. abs/1411.3406, 2014. [Online]. Available: http://arxiv.org/abs/1411.3406

Original

2014

Cited alongside, same era.

I. Waldspurger, A. d’Aspremont, and S. Mallat, “Phase recovery, maxcut and complex semidefinite programming,” Mathematical Programming , vol. 149, no. 1-2, pp. 47–81, 2015

2015

Cited alongside, same era.

E. J. Candes, X. Li, and M. Soltanolkotabi, “Phase retrieval via Wirtinger flow: Theory and algorithms,” Information Theory, IEEE Transactions on , vol. 61, no. 4, pp. 1985–2007, 2015

2015

Cited alongside, same era.

T. Goldstein and C. Studer, “PhaseMax: Convex Phase Retrieval via Basis Pursuit,” CoRR , vol. abs/1610.07531, 2016. [Online]. Available: http://arxiv.org/abs/1610.07531

Original

2016

Later among the works it cites.

P. Hand and V. Voroninski, “An Elementary Proof of Convex Phase Retrieval in the Natural Parameter Space via the Linear Program PhaseMax,” arXiv:1611.03935 [cs, math] , Nov. 2016, arXiv: 1611.03935. [Online]. Available: http://arxiv.org/abs/1611.03935

Original

2016

Later among the works it cites.

C. Thrampoulidis, E. Abbasi, and B. Hassibi, “Precise error analysis of regularized m-estimators in high-dimensions,” CoRR , vol. abs/1601.06233, 2016. [Online]. Available: http://arxiv.org/abs/1601.06233

Original

2016

Later among the works it cites.

P. Hand and V. Voroninski, “An elementary proof of convex phase retrieval in the natural parameter space via the linear program phasemax,” arXiv:1611.03935 , 2016

Original

2016

Later among the works it cites.