Hostname: page-component-6898cfcb55-zsp5v Total loading time: 0 Render date: 2026-11-12T03:26:07.300Z Has data issue: false hasContentIssue false

Majorization as a Tool for Optimizing a Class of Matrix Functions

Published online by Cambridge University Press:  01 January 2025

Henk A. L. Kiers*
Affiliation:
University of Groningen
*
Requests for reprints should be addressed to Henk A. L. Kiers, Department of Psychology, Grote Kruisstr. 2/1, 9712 TS Groningen, THE NETHERLANDS.

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.

Information

Type
Original Paper
Copyright
Copyright © 1990 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable