On Generalizing Trace Minimization
Xin Liang, Li Wang, Lei-Hong Zhang, Ren-Cang Li

TL;DR
This paper extends Ky Fan's trace minimization principle to a broader class of matrix optimization problems on the Stiefel manifold, providing conditions for finiteness and explicit solutions involving eigenvalues and eigenvectors.
Contribution
It generalizes trace minimization to cases with indefinite matrices and derives explicit solutions using eigenstructure analysis.
Findings
Conditions for finiteness of the trace minimization problem
Explicit solutions in terms of eigenvalues and eigenvectors
Extension to indefinite and singular matrices
Abstract
Ky Fan's trace minimization principle is extended along the line of the Brockett cost function in on the Stiefel manifold, where of an apt size is positive definite. Specifically, we investigate subject to or . We establish conditions under which the infimum is finite and when it is finite, analytic solutions are obtained in terms of the eigenvalues and eigenvectors of the matrix pencil , where is possibly indefinite and singular, and is also possibly indefinite.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Random Matrices and Applications · Markov Chains and Monte Carlo Methods
