Pages that link to "Item:Q2410810"
From MaRDI portal
The following pages link to The local convexity of solving systems of quadratic equations (Q2410810):
Displaying 15 items.
- On global convergence of gradient descent algorithms for generalized phase retrieval problem (Q1675386) (← links)
- A geometric analysis of phase retrieval (Q1785008) (← 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)
- Generalized phase retrieval: measurement number, matrix recovery and beyond (Q2325541) (← links)
- Almost everywhere injectivity conditions for the matrix recovery problem (Q2659725) (← links)
- Low-rank spectral optimization via gauge duality (Q2811991) (← links)
- Guarantees of Riemannian optimization for low rank matrix recovery (Q2818273) (← links)
- Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems (Q2979257) (← links)
- Solving Systems of Quadratic Equations Via Exponential-Type Gradient Descent Algorithm (Q3385678) (← links)
- On the number of local maxima of a constrained quadratic form (Q4307716) (← links)
- Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization (Q5006447) (← links)
- (Q5159422) (← links)
- Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recovery (Q5214201) (← links)
- Gradient descent with non-convex constraints: local concavity determines convergence (Q5242862) (← links)
