English

On the convergence of orthogonalization-free conjugate gradient method for extreme eigenvalues of Hermitian matrices: a Riemannian optimization interpretation

Numerical Analysis 2023-12-05 v3 Numerical Analysis Optimization and Control

Abstract

In many applications, it is desired to obtain extreme eigenvalues and eigenvectors of large Hermitian matrices by efficient and compact algorithms. In particular, orthogonalization-free methods are preferred for large-scale problems for finding eigenspaces of extreme eigenvalues without explicitly computing orthogonal vectors in each iteration. For the top pp eigenvalues, the simplest orthogonalization-free method is to find the best rank-pp approximation to a positive semi-definite Hermitian matrix by algorithms solving the unconstrained Burer-Monteiro formulation. We show that the nonlinear conjugate gradient method for the unconstrained Burer-Monteiro formulation is equivalent to a Riemannian conjugate gradient method on a quotient manifold with the Bures-Wasserstein metric, thus its global convergence to a stationary point can be proven. Numerical tests suggest that it is efficient for computing the largest kk eigenvalues for large-scale matrices if the largest kk eigenvalues are nearly distributed uniformly.

Keywords

Cite

@article{arxiv.2302.04974,
  title  = {On the convergence of orthogonalization-free conjugate gradient method for extreme eigenvalues of Hermitian matrices: a Riemannian optimization interpretation},
  author = {Shixin Zheng and Haizhao Yang and Xiangxiong Zhang},
  journal= {arXiv preprint arXiv:2302.04974},
  year   = {2023}
}