Abstract
Optimization of a cost function J(W) under an orthogonality constraint WWT = I is a common requirement for ICA methods. In this paper, we will review the use of Lie group methods to perform this constrained optimization. Instead of searching in the space of n × n matrices W, we will introduce the concept of the Lie group SO(n) of orthogonal matrices, and the corresponding Lie algebra so(n). Using so(n) for our coordinates, we can multiplicatively update W by a rotation matrix R so that W′ = RW always remains orthogonal. Steepest descent and conjugate gradient algorithms can be used in this framework.
Cite
CITATION STYLE
Plumbley, M. D. (2004). Lie group methods for optimization with orthogonality constraints. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3195, 1245–1252. https://doi.org/10.1007/978-3-540-30110-3_157
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.