Riemannian optimization methods for the truncated Takagi factorization.

This paper focuses on algorithms for the truncated Takagi factorization of complex symmetric matrices. The problem is formulated as a Riemannian optimization problem on a complex Stiefel manifold and then is converted into a real Riemannian optimization problem on the intersection of the real Stiefel manifold and the quasi-symplectic set. The steepest descent, the Riemannian nonmonotone conjugate gradient, Newton, and hybrid methods are used for solving the problem and they are compared in their performance for the optimization task. Numerical experiments are provided to illustrate the efficiency of the proposed method. [ABSTRACT FROM AUTHOR]