A generalized power iteration method for solving quadratic problem on the Stiefel manifold

Abstract

In this paper, we first propose a novel generalized power iteration method (GPI) to solve the quadratic problem on the Stiefel manifold (QPSM) as min_{W^TW=I}Tr(W^TAW-2W^TB) along with the theoretical analysis. Accordingly, its special case known as the orthogonal least square regression (OLSR) is under further investigation. Based on the aforementioned studies, we then cast major focus on solving the unbalanced orthogonal procrustes problem (UOPP). As a result, not only a general convergent algorithm is derived theoretically but the efficiency of the proposed approach is verified empirically as well.

References in corpus (1)

• Generalized power method for sparse principal component analysis

Cited by in corpus (6)

• A Theory of the NEPv Approach for Optimization On the Stiefel Manifold
• Supervised feature selection with orthogonal regression and feature weighting
• Adaptive Graph-based Generalized Regression Model for Unsupervised Feature Selection
• Robust Bhattacharyya bound linear discriminant analysis through adaptive algorithm
• Trace Ratio Optimization with an Application to Multi-view Learning
• Discrete Optimal Graph Clustering