Minimization of a class of matrix trace functions by means of refined majorization
- 221 Downloads
A procedure is described for minimizing a class of matrix trace functions. The procedure is a refinement of an earlier procedure for minimizing the class of matrix trace functions using majorization. It contains a recently proposed algorithm by Koschat and Swayne for weighted Procrustes rotation as a special case. A number of trial analyses demonstrate that the refined majorization procedure is more efficient than the earlier majorization-based procedure.
Key wordstrace optimization majorization alternating least squares
Unable to display preview. Download preview PDF.
- Bijleveld, C. J. H. (1989).Exploratory linear dynamical systems analysis. Leiden: DSWO Press.Google Scholar
- Bijleveld, C., & de Leeuw, J. (1987, June).Fitting linear dynamical systems by alternating least squares. Paper presented at the European Meeting of the Psychometric Society, Twente, The Netherlands.Google Scholar
- Henderson, H. V., & Searle, S. R. (1981). The vec-permutation matrix, the vec operator and Kronecker products: A review.Linear and multilinear algebra, 9, 271–288.Google Scholar
- Kiers, H. A. L. (1990). Majorization as a tool for optimizing a class of matrix functions.Psychometrika, 55, 417–428.Google Scholar
- Rao, C. R. (1980). Matrix approximations and reduction of dimensionality in multivariate statistical analysis. In P. R. Krishnaiah (Ed.),Multivariate analysis V (pp. 3–22). Amsterdam: North-Holland.Google Scholar
- Roth, W. E. (1934). On direct product matrices.Bulletin of the American Mathematical Society, 40, 461–468.Google Scholar
- Takane, Y., & Shibayama, T. (1991). Principal component analysis with external information on both subjects and variables.Psychometrika, 56, 97–120.Google Scholar