Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
From MaRDI portal
Publication:2979257
DOI10.1002/cpa.21638zbMath1379.90024arXiv1505.05114OpenAlexW2542482481MaRDI QIDQ2979257
Emmanuel J. Candès, Yuxin Chen
Publication date: 3 May 2017
Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.05114
Related Items
The numerics of phase retrieval, Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recovery, Subgradient methods for sharp weakly convex functions, Approximate message passing with spectral initialization for generalized linear models*, Fast Phase Retrieval from Local Correlation Measurements, Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization, Nonconvex Low-Rank Tensor Completion from Noisy Data, Analytical convergence regions of accelerated gradient descent in nonconvex optimization under regularity condition, Guarantees of Riemannian optimization for low rank matrix completion, On global convergence of gradient descent algorithms for generalized phase retrieval problem, Quantization-aware phase retrieval, The local convexity of solving systems of quadratic equations, Linear Convergence of Randomized Kaczmarz Method for Solving Complex-Valued Phaseless Equations, On connections between amplitude flow and error reduction for phase retrieval and ptychography, Iterative hard thresholding for low-rank recovery from rank-one projections, Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution, Fundamental limits of weak recovery with applications to phase retrieval, Finding robust minimizer for non-convex phase retrieval, Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs, A Generalization of Wirtinger Flow for Exact Interferometric Inversion, Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval, Misspecified nonconvex statistical optimization for sparse phase retrieval, Phase Retrieval by Linear Algebra, Affine phase retrieval for sparse signals via \(\ell_1\) minimization, Provable sample-efficient sparse phase retrieval initialized by truncated power method, Nearly optimal bounds for the global geometric landscape of phase retrieval, Provable Phase Retrieval with Mirror Descent, Performance bounds of the intensity-based estimators for noisy phase retrieval, Stochastic Model-Based Minimization of Weakly Convex Functions, Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization, PhaseMax: Stable guarantees from noisy sub-Gaussian measurements, Complex phase retrieval from subgaussian measurements, Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation, Smoothed amplitude flow-based phase retrieval algorithm, Phase retrieval from Fourier measurements with masks, Scalable incremental nonconvex optimization approach for phase retrieval, Spectral Compressed Sensing via Projected Gradient Descent, On DC based methods for phase retrieval, On signal reconstruction from FROG measurements, Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data, Spectral method and regularized MLE are both optimal for top-\(K\) ranking, Benchmark Problems for Phase Retrieval, Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence, Phase Retrieval from Incomplete Magnitude Information via Total Variation Regularization, A Proximal Operator for Multispectral Phase Retrieval Problems, Solving phase retrieval via graph projection splitting, A Spectral Estimation Framework for Phase Retrieval via Bregman Divergence Minimization, The Global Landscape of Phase Retrieval II: Perturbed Amplitude Models, The Global Landscape of Phase Retrieval II: Quotient Intensity Models, Proof methods for robust low-rank matrix recovery, Sampling complexity on phase retrieval from masked Fourier measurements via Wirtinger flow*, Toward a Mathematical Theory of the Crystallographic Phase Retrieval Problem, Solving phase retrieval with random initial guess is nearly as good as by spectral initialization
Cites Work
- Alternating projection, ptychographic imaging and phase synchronization
- Improved recovery guarantees for phase retrieval from coded diffraction patterns
- Low rank matrix recovery from rank one measurements
- Stable optimizationless recovery from phaseless linear measurements
- Solving quadratic equations via phaselift when there are about as many equations as unknowns
- Statistical guarantees for the EM algorithm: from population to sample-based analysis
- Painless reconstruction from magnitudes of frame coefficients
- Saving phase: injectivity and stability for phase retrieval
- ROP: matrix recovery via rank-one projections
- A partial derandomization of phaselift using spherical designs
- The local convexity of solving systems of quadratic equations
- Phase retrieval: stability and recovery guarantees
- Phase recovery, MaxCut and complex semidefinite programming
- Phase retrieval from coded diffraction patterns
- Lectures on Modern Convex Optimization
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- Sparse Signal Recovery from Quadratic Measurements via Convex Programming
- Phase Retrieval with Polarization
- Guaranteed Matrix Completion via Non-Convex Factorization
- Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming
- Phase Retrieval via Wirtinger Flow: Theory and Algorithms
- Multireference alignment using semidefinite programming
- Random projections and the optimization of an algorithm for phase retrieval
- Convex and Nonconvex Formulations for Mixed Regression With Two Components: Minimax Optimal Rates
- GESPAR: Efficient Phase Retrieval of Sparse Signals
- Compressive Phase Retrieval via Generalized Approximate Message Passing
- Phase Retrieval Using Alternating Minimization
- Matrix Completion From a Few Entries
- Probability and Computing
- Low-rank matrix completion using alternating minimization
- The Rotation of Eigenvectors by a Perturbation. III
- Introduction to nonparametric estimation
