Pages that link to "Item:Q5006501"
From MaRDI portal
The following pages link to Solving (most) of a set of quadratic equalities: composite optimization for robust phase retrieval (Q5006501):
Displaying 25 items.
- 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)
- Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence (Q2067681) (← links)
- Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization (Q2089785) (← links)
- Constructing confidence intervals for the signals in sparse phase retrieval (Q2136624) (← links)
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria (Q2220664) (← links)
- Efficiency of minimizing compositions of convex functions and smooth maps (Q2330660) (← 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)
- Strong Metric (Sub)regularity of Karush–Kuhn–Tucker Mappings for Piecewise Linear-Quadratic Convex-Composite Optimization and the Quadratic Convergence of Newton’s Method (Q3387919) (← links)
- Stochastic Model-Based Minimization of Weakly Convex Functions (Q4620418) (← links)
- Local saddles of relaxed averaged alternating reflections algorithms on phase retrieval (Q5014488) (← links)
- A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications (Q5026439) (← links)
- Low rank matrix recovery with adversarial sparse noise* (Q5030160) (← links)
- Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization (Q5037570) (← links)
- Graphical Convergence of Subgradients in Nonconvex Optimization and Learning (Q5076697) (← links)
- Nonconvex Robust Low-Rank Matrix Recovery (Q5217366) (← links)
- Robust phase retrieval via median-truncated smoothed amplitude flow (Q5861324) (← links)
- A Spectral Estimation Framework for Phase Retrieval via Bregman Divergence Minimization (Q5863521) (← links)
- Distributed Stochastic Inertial-Accelerated Methods with Delayed Derivatives for Nonconvex Problems (Q5863523) (← 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)
- Sharp global convergence guarantees for iterative nonconvex optimization with random data (Q6046308) (← links)
- SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization (Q6498409) (← links)