Majorization as a Tool for Optimizing a Class of Matrix Functions
- 1 September 1990
- journal article
- Published by Cambridge University Press (CUP) in Psychometrika
- Vol. 55 (3) , 417-428
- https://doi.org/10.1007/bf02294758
Abstract
The problem of minimizing a general matrix, trace function, possibly subject to certain constraints, is approached by means of majorizing this function by one having a simple quadratic shape and whose minimum is easily found. It is shown that the parameter set that minimizes the majorizing function also decreases the matrix trace function, which in turn provides a monotonically convergent algorithm for minimizing the matrix trace function iteratively. Three algorithms based on majorization for solving certain least squares problems are shown to be special cases. In addition, by means of several examples, it is noted how algorithms may be provided for a wide class of statistical optimization tasks for which no satisfactory algorithms seem available.Keywords
This publication has 10 references indexed in Scilit:
- A Generalization of Takane's Algorithm for DedicomPsychometrika, 1990
- Convergence of the majorization method for multidimensional scalingJournal of Classification, 1988
- Correspondence analysis with least absolute residualsComputational Statistics & Data Analysis, 1987
- Principal Component Analysis of Three-Mode Data by Means of Alternating Least Squares AlgorithmsPsychometrika, 1980
- A Direct Approach to Individual differences Scaling using Increasingly Complex TransformationsPsychometrika, 1978
- Additive Structure in Qualitative Data: An Alternating Least Squares Method with Optimal Scaling FeaturesPsychometrika, 1976
- Regression with Qualitative and Quantitative Variables: An Alternating Least Squares Method with Optimal Scaling FeaturesPsychometrika, 1976
- Solving Implicit Equations in Psychometric Data AnalysisPsychometrika, 1975
- Orthogonal Rotation to CongruencePsychometrika, 1966
- The approximation of one matrix by another of lower rankPsychometrika, 1936