An iterative majorization algorithm is proposed for orthogonal congruence rotation that is guaranteed to converge from every starting point. In addition, the algorithm is easier to program than the algorithm proposed by F. B. Brokken, which is not guaranteed to converge. The derivation of the algorithm is traced in detail. (SLD)

Monte Carlo procedures were used to investigate the properties of a nonmetric multidimensional scaling algorithm when used to scale an incomplete matrix of dissimilarities. Recommendations for users wishing to scale incomplete matrices are made. (Author/RC)

Described is a Fortran computer program for an alternative algorithm for Thurstone's pair comparisons method. This algorithm provides an improved capacity for handling indeterminate proportions of one and zero as well as untruncated estimates of population scale values. (Author/JKS)

Applications to the Promax Rotation are discussed, and it is shown that these procedures solve Thurstone's hitherto intractable "invariant" box problem as well as other more common problems based on real data. (Author/RC)