Pages that link to "Item:Q1785008"
From MaRDI portal
The following pages link to A geometric analysis of phase retrieval (Q1785008):
Displaying 41 items.
- Synchronization of Kuramoto oscillators in dense networks (Q5136515) (← links)
- (Q5159422) (← links)
- The Geometry of Ambiguity in One-Dimensional Phase Retrieval (Q5208887) (← links)
- Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold (Q5210519) (← links)
- Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA (Q5214234) (← links)
- On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization (Q5231691) (← links)
- A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (Q5853567) (← links)
- The nonsmooth landscape of phase retrieval (Q5857359) (← links)
- Generalized approximate survey propagation for high-dimensional estimation <sup>*</sup> (Q5857450) (← 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)
- Asymptotic Properties of Stationary Solutions of Coupled Nonconvex Nonsmooth Empirical Risk Minimization (Q5868947) (← links)
- Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity (Q5869813) (← links)
- The numerics of phase retrieval (Q5887821) (← links)
- Lower bounds for non-convex stochastic optimization (Q6038643) (← links)
- Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis (Q6041110) (← links)
- Likelihood landscape and maximum likelihood estimation for the discrete orbit recovery model (Q6049741) (← links)
- Analysis of the optimization landscape of Linear Quadratic Gaussian (LQG) control (Q6052067) (← links)
- Gradient-Type Methods for Optimization Problems with Polyak-Łojasiewicz Condition: Early Stopping and Adaptivity to Inexactness Parameter (Q6090757) (← links)
- Adaptive trust-region method on Riemannian manifold (Q6111659) (← links)
- Compressive phase retrieval: Optimal sample complexity with deep generative priors (Q6141977) (← links)
- Self-Supervised Deep Learning for Image Reconstruction: A Langevin Monte Carlo Approach (Q6144068) (← links)
- On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization (Q6158001) (← 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)
- Signal Reconstruction from Phase-Only Measurements: Uniqueness Condition, Minimal Measurement Number and Beyond (Q6168005) (← links)
- Provable Phase Retrieval with Mirror Descent (Q6168333) (← links)
- Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method (Q6172167) (← links)
- Local convexity of the TAP free energy and AMP convergence for \(\mathbb{Z}_2\)-synchronization (Q6172186) (← links)
- Low-Rank Univariate Sum of Squares Has No Spurious Local Minima (Q6176423) (← links)
- Performance bounds of the intensity-based estimators for noisy phase retrieval (Q6185682) (← links)
- Tractability from overparametrization: the example of the negative perceptron (Q6193766) (← links)
- SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization (Q6498409) (← links)
- Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants (Q6540011) (← links)
- Towards a bilipschitz invariant theory (Q6567399) (← links)
- A new complexity metric for nonconvex rank-one generalized matrix completion (Q6608034) (← links)
- Three proofs of the Benedetto-Fickus theorem (Q6608656) (← links)
- A deterministic gradient-based approach to avoid saddle points (Q6622959) (← links)
- Wirtinger gradient descent methods for low-dose Poisson phase retrieval (Q6654166) (← links)
- Gradient descent provably escapes saddle points in the training of shallow ReLU networks (Q6655804) (← links)
