期刊
MATHEMATICAL PROGRAMMING
卷 149, 期 1-2, 页码 47-81出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s10107-013-0738-9
关键词
-
类别
资金
- European Research Council (ERC)
- ERC Invariant-Class [320959]
- [ANR10-BLAN-0126]
Phase retrieval seeks to recover a signal from the amplitude of linear measurements . We cast the phase retrieval problem as a non-convex quadratic program over a complex phase vector and formulate a tractable relaxation (called PhaseCut) similar to the classical MaxCut semidefinite program. We solve this problem using a provably convergent block coordinate descent algorithm whose structure is similar to that of the original greedy algorithm in Gerchberg and Saxton (Optik 35:237-246, 1972), where each iteration is a matrix vector product. Numerical results show the performance of this approach over three different phase retrieval problems, in comparison with greedy phase retrieval algorithms and matrix completion formulations.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据