Estimating common principal components in high dimensions

From MaRDI portal




Abstract: We consider the problem of minimizing an objective function that depends on an orthonormal matrix. This situation is encountered when looking for common principal components, for example, and the Flury method is a popular approach. However, the Flury method is not effective for higher dimensional problems. We obtain several simple majorization-minizmation (MM) algorithms that provide solutions to this problem and are effective in higher dimensions. We then use simulated data to compare them with other approaches in terms of convergence and computational time.



Cites work


Cited in
(37)


Describes a project that uses

Uses Software





This page was built for publication: Estimating common principal components in high dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q95891)