Pages that link to "Item:Q2979257"

The following pages link to Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems (Q2979257):

Displaying 38 items.

• Subgradient methods for sharp weakly convex functions (Q1626538) (← links)
• Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization (Q1645274) (← links)
• On global convergence of gradient descent algorithms for generalized phase retrieval problem (Q1675386) (← links)
• Phase retrieval from Fourier measurements with masks (Q1983452) (← links)
• Scalable incremental nonconvex optimization approach for phase retrieval (Q2023709) (← links)
• On DC based methods for phase retrieval (Q2050353) (← links)
• Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data (Q2054540) (← links)
• Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence (Q2067681) (← links)
• Proof methods for robust low-rank matrix recovery (Q2106469) (← links)
• Solving phase retrieval with random initial guess is nearly as good as by spectral initialization (Q2118400) (← links)
• Analytical convergence regions of accelerated gradient descent in nonconvex optimization under regularity condition (Q2173914) (← links)
• Guarantees of Riemannian optimization for low rank matrix completion (Q2176515) (← links)
• Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution (Q2189396) (← links)
• Complex phase retrieval from subgaussian measurements (Q2226993) (← links)
• Smoothed amplitude flow-based phase retrieval algorithm (Q2230851) (← links)
• On signal reconstruction from FROG measurements (Q2300769) (← links)
• Spectral method and regularized MLE are both optimal for top-\(K\) ranking (Q2313284) (← links)
• The local convexity of solving systems of quadratic equations (Q2410810) (← links)
• Iterative hard thresholding for low-rank recovery from rank-one projections (Q2419026) (← links)
• Fundamental limits of weak recovery with applications to phase retrieval (Q2420637) (← links)
• Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval (Q2425162) (← links)
• Misspecified nonconvex statistical optimization for sparse phase retrieval (Q2425184) (← links)
• On connections between amplitude flow and error reduction for phase retrieval and ptychography (Q2675194) (← links)
• Phase Retrieval from Incomplete Magnitude Information via Total Variation Regularization (Q2833539) (← links)
• Fast Phase Retrieval from Local Correlation Measurements (Q3179618) (← links)
• Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation (Q3296183) (← links)
• Solving phase retrieval via graph projection splitting (Q5000597) (← links)
• Approximate message passing with spectral initialization for generalized linear models* (Q5055411) (← links)
• Nonconvex Low-Rank Tensor Completion from Noisy Data (Q5080674) (← links)
• The Global Landscape of Phase Retrieval II: Perturbed Amplitude Models (Q5865904) (← links)
• The Global Landscape of Phase Retrieval II: Quotient Intensity Models (Q5865908) (← links)
• Sampling complexity on phase retrieval from masked Fourier measurements via Wirtinger flow* (Q5867683) (← links)
• Finding robust minimizer for non-convex phase retrieval (Q6087986) (← links)
• Affine phase retrieval for sparse signals via \(\ell_1\) minimization (Q6160008) (← links)
• Provable sample-efficient sparse phase retrieval initialized by truncated power method (Q6162742) (← links)
• Nearly optimal bounds for the global geometric landscape of phase retrieval (Q6162747) (← links)
• Provable Phase Retrieval with Mirror Descent (Q6168333) (← links)
• Performance bounds of the intensity-based estimators for noisy phase retrieval (Q6185682) (← links)