Riemannian Trust Region Method for Haplotype Assembly

Abstract

In this letter we model the Haplotype assembly problem (HAP) as a maximization problem over an $(n-1)$-dimensional sphere. Due to nonconvexity of the feasible set, we propose a manifold optimization approach to solve the mentioned maximization problem. To escape local maxima as well as saddle points we utilize trust region method. Simulation results show that our proposed method is with high accuracy in estimation of Haplotype.