Solving PhaseLift by low rank Riemannian optimization methods
Authors
Wen Huang, K. A. Gallivan, Xiangxiong Zhang
Abstract
A framework, PhaseLift, was recently proposed to solve the phase retrieval problem. In this framework, the problem is solved by optimizing a cost function over the set of complex Hermitian positive semidefinite matrices. This paper considers an approach based on an alternative cost function defined on a union of appropriate manifolds. It is related to the original cost function in a manner that preserves the ability to find a global minimizer and is significantly more efficient computationally. A rank-based optimality condition for stationary points is given and optimization algorithms based on state-of-the-art Riemannian optimization and dynamically reducing rank are proposed. Empirical evaluations are performed using the PhaseLift problem. The new approach is shown to be an effective method of phase retrieval with computational efficiency increased substantially compared to the algorithm used in original PhaseLift paper.
Key words
Riemannian Optimization; Low rank optimization; Complex optimization; Phase Retrieval; PhaseLift
Status
Procedia Computer Science, 80:1125-1134, 2016.
Download
BibTex entry
- Technical Report
@TECHREPORT{HGZ2016,
author = "Wen Huang and K. A. Gallivan and Xiangxiong Zhang",
title = "Solving PhaseLift by low rank Riemannian optimization methods",
institution = "U.C.Louvain",
note = "short version",
year = 2016,
number = "UCL-INMA-2016.02",
month = "January",
}