I.4.3.5: Squared Distance Scaling

In ALSCAL [Takane, Young, De Leeuw, 1977] we find multidimensional scaling solutions by minimizing the loss function sstress, defined by Thus known dissimilarities are approximated by squared Euclidean distances between points, which have coordinates in an matrix . Both dissimilarities and the weights are non-negative, symmetric, and hollow. Thus

Takane et al. discuss different block relaxation approaches to minimizing . Because the loss function is a multivariate quartic the stationary equations obtained by setting the partials equal to zero are a system of cubic equations in unknowns. So, at least theoretically, we could use algebraic methods to solve the stationary equations and find the global minimum of sstress. This corresponds with the case in which there is only a single block of coordinates, but in the ALSCAL context other blocks are introduced by optimally transforming the dissimilarities and by incorporating weights for individual difference MDS models. At the other extreme of the block relaxation spectrum we could introduce blocks for the coordinates, which means we would use coordinate descent. Takane et al. ultimately decide to use a generalized block relaxation method with blocks of the coordinates of a single point, with a safeguarded Newton method used to minimize over a single block.

In this section we study coordinate descent in detail. If we modify coordinate then only the squared distances and with will change. Adding to with change to . Thus the part of sstress that depends on is . Differentiating this and setting the derivative to zero gives the cubic equation