Fetching the paper…
Reading the bibliography…
This paper develops a novel algorithm, termed \emph{SPARse Truncated Amplitude flow} (SPARTA), to reconstruct a sparse signal from a small number of magnitude-only measurements.
E. Hofstetter, “Construction of time-limited functions with specified autocorrelation functions,”
1964
Earlier work this paper cites.
R. W. Gerchberg and W. O. Saxton, “A practical algorithm for the determination of phase from image and diffraction,”
1972
Earlier work this paper cites.
J. R. Fienup, “Phase retrieval algorithms: A comparison,”
1982
Earlier work this paper cites.
P. M. Pardalos and S. A. Vavasis, “Quadratic programming with one negative eigenvalue is NP-hard,”
1991
Earlier work this paper cites.
B. Laurent and P. Massart, “Adaptive estimation of a quadratic functional by model selection,”
2000
Earlier work this paper cites.
V. Bentkus, “An inequality for tail probabilities of martingales with differences bounded from one side,”
2003
Earlier work this paper cites.
E. J. Candes and T. Tao, “Decoding by linear programming,”
2005
Earlier work this paper cites.
M. L. Moravec, J. K. Romberg, and R. G. Baraniuk, “Compressive phase retrieval,”
2007
Earlier work this paper cites.
A. d’Aspremont, L. El Ghaoui, M. I. Jordan, and G. R. Lanckriet, “A direct formulation for sparse PCA using semidefinite programming,”
2007
Earlier work this paper cites.
T. Blumensath and M. E. Davies, “Iterative hard thresholding for compressed sensing,”
2009
Earlier work this paper cites.
D. Needell and J. A. Tropp, “CoSaMP: Iterative signal recovery from incomplete and inaccurate samples,”
2009
Earlier work this paper cites.
A. A. Amini and M. J. Wainwright, “High-dimensional analysis of semidefinite relaxations for sparse principal components,”
2009
Earlier work this paper cites.
R. Vershynin, “Introduction to the non-asymptotic analysis of random matrices,”
2010
Earlier work this paper cites.
H. Ohlsson, A. Y. Yang, R. Dong, and S. S. Sastry, “CPRL–An extension of compressive sensing to the phase retrieval problem,” in
2012
Earlier work this paper cites.
E. J. Candès, T. Strohmer, and V. Voroninski, “PhaseLift: Exact and stable signal recovery from magnitude measurements via convex programming,”
2013
Earlier work this paper cites.
X. Li and V. Voroninski, “Sparse signal recovery from quadratic measurements via convex programming,”
2013
Earlier work this paper cites.
T. Cai, J. Fan, and T. Jiang, “Distributions of angles in random packing on spheres,”
2013
Earlier work this paper cites.
Y. Shechtman, A. Beck, and Y. C. Eldar, “GESPAR: Efficient phase retrieval of sparse signals,”
2014
Earlier work this paper cites.
Y. C. Eldar and S. Mendelson, “Phase retrieval: Stability and recovery guarantees,”
2014
Earlier work this paper cites.
P. Netrapalli, P. Jain, and S. Sanghavi, “Phase retrieval using alternating minimization,”
2015
Earlier work this paper cites.
E. J. Candès, X. Li, and M. Soltanolkotabi, “Phase retrieval via Wirtinger flow: Theory and algorithms,”
2015
Earlier work this paper cites.
E. J. Candès, Y. C. Eldar, T. Strohmer, and V. Voroninski, “Phase retrieval via matrix completion,”
2015
Cited alongside, same era.
E. J. Candès, X. Li, and M. Soltanolkotabi, “Phase retrieval from coded diffraction patterns,”
2015
Cited alongside, same era.
I. Waldspurger, A. d’Aspremont, and S. Mallat, “Phase recovery, maxcut and complex semidefinite programming,”
2015
Cited alongside, same era.
K. Jaganathan, Y. C. Eldar, and B. Hassibi, “Phase retrieval: An overview of recent developments,”
2015
Cited alongside, same era.
P. Schniter and S. Rangan, “Compressive phase retrieval via generalized approximate message passing,”
2015
Cited alongside, same era.
T. Qiu and D. Palomar, “Undersampled sparse phase retrieval via majorization-minimization,”
2016
Closest in time.
R. Sun and Z. Q. Luo, “Guaranteed matrix completion via non-convex factorization,”
2016
Closest in time.
2016
Closest in time.
2016
Closest in time.
Y. Chen and E. J. Candès, “Solving random quadratic systems of equations is nearly as easy as solving linear systems,”
2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Conca, D. Edidin, M. Hering, and C. Vinzant, “An algebraic characterization of injectivity in phase retrieval,”
2015
Cited alongside, same era.
M. Akcakaya and V. Tarokh, “Sparse signal recovery from a mixture of linear and magnitude-only measurements,”
2015
Cited alongside, same era.
L.-H. Yeh, J. Dong, J. Zhong, L. Tian, M. Chen, G. Tang, M. Soltanolkotabi, and L. Waller, “Experimental robustness of Fourier ptychography phase retrieval algorithms,”
2015
Cited alongside, same era.
Y. C. Eldar, N. Hammen, and D. G. Mixon, “Recent advances in phase retrieval [lecture notes],”
2016
Cited alongside, same era.
T. Bendory and Y. C. Eldar, “Non-convex phase retrieval from STFT measurements,”
2016
Cited alongside, same era.
2016
Cited alongside, same era.
I. Waldspurger, “Phase retrieval with random Gaussian sensing vectors by alternating projections,”
2016
Cited alongside, same era.
P. Chen, A. Fannjiang, and G.-R. Liu, “Phase retrieval with one or two diffraction patterns by alternating projection with null initialization,”
2017
Closest in time.
G. Wang, G. B. Giannakis, and J. Chen, “Scalable solvers of random quadratic equations via stochastic truncated amplitude flow,”
2017
Closest in time.
2017
Closest in time.
Y. Li, Y. Sun, and Y. Chi, “Low-rank positive semidefinite matrix recovery from corrupted rank-one measurements,”
2017
Closest in time.
2017
Closest in time.
J. Duchi and F. Ruan, “Stochastic methods for composite optimization problems,”
2017
Closest in time.
2017
Closest in time.
A. Andoni, D. Hsu, K. Shi, and X. Sun, “Correspondence retrieval,”
2017
Closest in time.
H. Chang, S. Marchesini, Y. Lou, and T. Zeng, “Variational phase retrieval with globally convergent preconditioned proximal algorithm,” 2017
2017
Closest in time.
2017
Closest in time.
Y. Li and V. Nakos, “Sublinear-time algorithms for compressive phase retrieval,”
2017
Closest in time.
O. Dhifallah and Y. M. Lu, “Fundamental limits of PhaseMax for phase retrieval: A replica analysis,”
2017
Closest in time.
M. Iwen, A. Viswanathan, and Y. Wang, “Robust sparse phase retrieval made easy,”
2017
Closest in time.
2017
Closest in time.
2017
Closest in time.
S. Lu, M. Hong, and Z. Wang, “A nonconvex splitting method for symmetric nonnegative matrix factorization: Convergence analysis and optimality,”
2017
Closest in time.