Solving systems of phaseless equations via Riemannian optimization with optimal sampling complexity
DOI10.4208/JCM.2207-M2021-0247MaRDI QIDQ6617000
Publication date: 9 October 2024
Published in: Journal of Computational Mathematics (Search for Journal in Brave)
Riemannian gradient descentmanifold of rank-1 and positive semidefinite matricesoptimal sampling complexityphaseless equations
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Cites Work
- Title not available (Why is that?)
- Improved recovery guarantees for phase retrieval from coded diffraction patterns
- Solving quadratic equations via phaselift when there are about as many equations as unknowns
- On signal reconstruction without phase
- Phase recovery, MaxCut and complex semidefinite programming
- Phase retrieval from coded diffraction patterns
- Guarantees of Riemannian optimization for low rank matrix recovery
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- Low-rank matrix completion by Riemannian optimization
- Phase Retrieval via Wirtinger Flow: Theory and Algorithms
- Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
- Solving systems of phaseless equations via Kaczmarz methods: a proof of concept study
- Optical Wavefront Reconstruction: Theory and Numerical Methods
- Solving Systems of Random Quadratic Equations via Truncated Amplitude Flow
- Phase Retrieval Using Alternating Minimization
Related Items (1)
This page was built for publication: Solving systems of phaseless equations via Riemannian optimization with optimal sampling complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6617000)
