In this paper, the trace minimization method for the generalized symmetric eigenvalue problems proposed by Sameh and Wisniewski  is reviewed. Convergence of an inexact trace minimization algorithm is established and a variant of the algorithm that uses expanding subspaces is introduced and compared with the block Jacobi-Davidson algorithm. © 2000 Elsevier Science B.V.
Sameh, A., & Tong, Z. (2000). The trace minimization method for the symmetric generalized eigenvalue problem. Journal of Computational and Applied Mathematics, 123(1–2), 155–175. https://doi.org/10.1016/S0377-0427(00)00391-5