Presented By: Department of Mathematics
Analysis/Probability Learning Seminar
Sparse Phase Retrieval via l1-penalized PhaseMax
Consider recovering a k-sparse signal from m measurements, which is known as Sparse Phase Retrieval problem. A recent proposed algorithm called PhaseMax solves the Phase Retrieval (non-sparse version) via linear program. We proved the l1-penalized PhaseMax algorithm solves the sparse Phase Retrieval. This talk is based on the paper "Compressed Sensing from Phaseless Gaussian Measurements via Linear Programming in the Natural Parameter Space" by P. Hand and V. Voroninski. Speaker(s): Yun Wei (University of Michigan)
Explore Similar Events
-
Loading Similar Events...