Convolutional Phase Retrieval via Gradient Descent

DOI10.1109/TIT.2019.2950717zbMath1446.94026arXiv1712.00716OpenAlexW2985894713MaRDI QIDQ5123818

No author found.

Publication date: 29 September 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.00716

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (5)

Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs ⋮ Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval ⋮ Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent ⋮ The global optimization geometry of shallow linear neural networks ⋮ Sparse power factorization: balancing peakiness and sample complexity

This page was built for publication: Convolutional Phase Retrieval via Gradient Descent