Solving Random Quadratic Systems of Equations Is Nearly as Easy as
Solving Linear Systems

Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems

19 May 2015

Emmanuel J. Candes

Papers citing "Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems"

7 / 57 papers shown

Title
Fast Algorithms for Robust PCA via Gradient Descent Xinyang Yi Dohyung Park Yudong Chen C. Caramanis 24 265 0 25 May 2016
Median-Truncated Nonconvex Approach for Phase Retrieval with Outliers Huishuai Zhang Yuejie Chi Yingbin Liang 22 55 0 11 Mar 2016
Fourier ptychographic reconstruction using Poisson maximum likelihood and truncated Wirtinger gradient Liheng Bian J. Suo J. Chung X. Ou Changhuei Yang F. Chen Qionghai Dai 17 87 0 01 Mar 2016
When Are Nonconvex Problems Not Scary? Ju Sun Qing Qu John N. Wright 24 166 0 21 Oct 2015
Optimal Rates of Convergence for Noisy Sparse Phase Retrieval via Thresholded Wirtinger Flow T. Tony Cai Xiaodong Li Zongming Ma 29 232 0 10 Jun 2015
Complete Dictionary Recovery over the Sphere Ju Sun Qing Qu John N. Wright 33 202 0 26 Apr 2015
Finding a sparse vector in a subspace: Linear sparsity using alternating directions Qing Qu Ju Sun John N. Wright 16 111 0 15 Dec 2014