Pages that link to "Item:Q1785008"

The following pages link to A geometric analysis of phase retrieval (Q1785008):

Displaying 50 items.

• An elementary proof of convex phase retrieval in the natural parameter space via the linear program PhaseMax (Q667019) (← links)
• Subgradient methods for sharp weakly convex functions (Q1626538) (← links)
• On global convergence of gradient descent algorithms for generalized phase retrieval problem (Q1675386) (← links)
• Using negative curvature in solving nonlinear programs (Q1694388) (← links)
• Learning semidefinite regularizers (Q1740575) (← links)
• The global optimization geometry of shallow linear neural networks (Q1988338) (← links)
• The landscape of empirical risk for nonconvex losses (Q1991675) (← links)
• Fast rank-one alternating minimization algorithm for phase retrieval (Q2000029) (← links)
• Scalable incremental nonconvex optimization approach for phase retrieval (Q2023709) (← links)
• Phase retrieval for sub-Gaussian measurements (Q2036411) (← links)
• On DC based methods for phase retrieval (Q2050353) (← links)
• Riemannian optimization for phase retrieval from masked Fourier measurements (Q2070288) (← links)
• On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint (Q2089778) (← links)
• Near-optimal bounds for signal recovery from blind phaseless periodic short-time Fourier transform (Q2107787) (← links)
• Finding the global optimum of a class of quartic minimization problem (Q2114839) (← links)
• Solving phase retrieval with random initial guess is nearly as good as by spectral initialization (Q2118400) (← links)
• Role of sparsity and structure in the optimization landscape of non-convex matrix sensing (Q2133410) (← links)
• Proximal methods avoid active strict saddles of weakly convex functions (Q2143222) (← links)
• Eigenvector phase retrieval: recovering eigenvectors from the absolute value of their entries (Q2168926) (← links)
• Phase retrieval using alternating minimization in a batch setting (Q2175024) (← links)
• Guarantees of Riemannian optimization for low rank matrix completion (Q2176515) (← links)
• Lower bounds for finding stationary points I (Q2205972) (← links)
• Complex phase retrieval from subgaussian measurements (Q2226993) (← links)
• Generalized phase retrieval: measurement number, matrix recovery and beyond (Q2325541) (← links)
• Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods (Q2330648) (← links)
• Phase retrieval via sensor network localization (Q2422613) (← links)
• Misspecified nonconvex statistical optimization for sparse phase retrieval (Q2425184) (← links)
• Stability estimates for phase retrieval from discrete Gabor measurements (Q2657389) (← links)
• Sparse signal recovery from phaseless measurements via hard thresholding pursuit (Q2667051) (← links)
• A limited-memory Riemannian symmetric rank-one trust-region method with a restart strategy (Q2674265) (← links)
• Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points (Q2696568) (← links)
• Nonconvex phase synchronization (Q2832892) (← links)
• Phase retrieval for sparse binary signal: uniqueness and algorithm (Q3121983) (← links)
• Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation (Q3296183) (← links)
• A Geometrical Study of Matching Pursuit Parametrization (Q4568940) (← links)
• Stochastic Model-Based Minimization of Weakly Convex Functions (Q4620418) (← links)
• On the Quadratic Convergence of the Cubic Regularization Method under a Local Error Bound Condition (Q4634142) (← links)
• (Q4969108) (← links)
• Rank Optimality for the Burer--Monteiro Factorization (Q4971016) (← links)
• (Q4999045) (← links)
• Solving phase retrieval via graph projection splitting (Q5000597) (← links)
• Toward a Mathematical Theory of the Crystallographic Phase Retrieval Problem (Q5027012) (← links)
• Extending the Step-Size Restriction for Gradient Descent to Avoid Strict Saddle Points (Q5027014) (← links)
• Analysis of Asymptotic Escape of Strict Saddle Sets in Manifold Optimization (Q5037575) (← links)
• Revisiting Landscape Analysis in Deep Neural Networks: Eliminating Decreasing Paths to Infinity (Q5051381) (← links)
• Linear Convergence of Randomized Kaczmarz Method for Solving Complex-Valued Phaseless Equations (Q5094627) (← links)
• Escaping Strict Saddle Points of the Moreau Envelope in Nonsmooth Optimization (Q5097019) (← links)
• A Generalization of Wirtinger Flow for Exact Interferometric Inversion (Q5109289) (← links)
• First-Order Methods for Nonconvex Quadratic Minimization (Q5113167) (← links)
• PhaseMax: Stable guarantees from noisy sub-Gaussian measurements (Q5132229) (← links)