The Majorization Method for MDS

The first is an algorithm for multidimensional scaling, developed by De Leeuw [1977]. We want to minimize with again Euclidean distance, i.e. We suppose weights and dissimilarities are symmetric and hollow (zero diagonal), and satisfy We now define the following objects Thus The next step is to use matrices. Let Now By Cauchy-Schwarz, which implies Now let This is called the Guttman-transform of a matrix Using this transform we see that for all pairs of configurations while for all configurations we have