arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1803.02652math.OCeess.SP
收藏

用凸松弛序列求解大规模一般相位恢复问题

Solving large-scale general phase retrieval problems via a sequence of convex relaxations

Reinier Doelman, H. Thao Nguyen, Michel Verhaegen

摘要:

提出了一种基于凸松弛的大规模广义相位恢复算法。一般的相位恢复问题包括:基于记录在图像(焦)平面中的点源的强度测量来估计光瞳平面中的光场的相位。非凸的问题,找到复杂的领域,产生正确的强度被重新制定为一个秩约束问题。核范数被用来获得相位恢复问题的凸松弛。提出了一种新的迭代法--基于凸优化的相位恢复算法(COPR),每次迭代都是求解一个凸优化问题。在无噪声的情况下,对于一类相位恢复问题,最小化问题的解线性地或更快地收敛到正确的解。由于核范数最小化问题的解决方案可以使用半定规划计算,这往往是一个昂贵的优化方面的可扩展性,我们提供了一个快速的ADMM算法,利用问题的结构。在一个现实的数值模拟研究中证明了COPR算法的性能,证明了其在可靠性和速度方面的改进,相对于最先进的方法。

英文摘要:

We present a convex relaxation-based algorithm for large-scale general phase retrieval problems. General phase retrieval problems include i.a. the estimation of the phase of the optical field in the pupil plane based on intensity measurements of a point source recorded in the image (focal) plane. The non-convex problem of finding the complex field that generates the correct intensity is reformulated into a rank constraint problem. The nuclear norm is used to obtain the convex relaxation of the phase retrieval problem. A new iterative method, indicated as Convex Optimization-based Phase Retrieval (COPR), is presented, with each iteration consisting of solving a convex problem. In the noise-free case and for a class of phase retrieval problems the solutions of the minimization problems converge linearly or faster towards a correct solution. Since the solutions to nuclear norm minimization problems can be computed using semidefinite programming, and this tends to be an expensive optimization in terms of scalability, we provide a fast ADMM algorithm that exploits the problem structure. The performance of the COPR algorithm is demonstrated in a realistic numerical simulation study, demonstrating its improvements in reliability and speed with respect to state-of-the-art methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑