We introduce a generalized Rayleigh-quotient ρA on the direct product of Grassmannians Gr( m, n) enabling a unified approach to well-known optimization tasks from different areas of numerical linear algebra, such as best low-rank approximations of tensors (data compression), geometric measures of entanglement (quantum computing), and subspace clustering (image processing). We compute the Riemannian gradient of ρA, characterize its critical points, and prove that they are generically nondegenerated. Moreover, we derive an explicit necessary condition for the nondegeneracy of the Hessian. Finally, we present two intrinsic methods for optimizing ρA—a Newton-like and a conjugated gradient—and compare our algorithms tailored to the above-mentioned applications with established ones from the literature.
No takes yet. Share an insight, caveat, or question.
Curtef et al. (2012) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: