Abstract
In this paper we study the convergence properties of an important class of multidimensional scaling algorithms. We unify and extend earlier qualitative results on convergence, which tell us when the algorithms are convergent. In order to prove global convergence results we use the majorization method. We also derive, for the first time, some quantitative convergence theorems, which give information about the speed of convergence. It turns out that in almost all cases convergence is linear, with a convergence rate close to unity. This has the practical consequence that convergence will usually be very slow, and this makes techniques to speed up convergence very important. It is pointed out that step-size techniques will generally not succeed in producing marked improvements in this respect.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
BORG, I. (1981),Anwendungsorientierte Multidimensionale Skalierung, Berlin, West Germany: Springer.
DEFAYS, D. (1978), “A Short Note on a Method of Seriation,”British Journal of Mathematical and Statistical Psychology, 31, 49–53.
DE LEEUW, J. (1977), “Applications of Convex Analysis to Multidimensional Scaling,” inRecent Developments in Statistics, eds. J.R. Barra, F. Brodeau, G. Romier and B. van Cutsem, Amsterdam: North Holland, 133–145.
DE LEEUW, J. (1984), “Differentiability of Kruskal's Stress at a Local Minimum.”Psychometrika, 49, 111–113.
DE LEEUW, J., and HEISER, W. J. (1980), “Multidimensional Scaling with Restrictions on the Configuration,” inMultivariate Analysis, Vol. V, ed. P. R. Krishnaiah, Amsterdam: North Holland.
DE LEEUW, J., and STOOP, I. (1984), “Upper Bounds for Kruskal's Stress,”Psychometrika, 49, 391–402.
GUTTMAN, L. (1968), “A General Nonmetric Technique for Finding the Smallest Coordinate Space for a Configuration of Points,”Psychometrika, 33, 469–506.
HARTMANN, W. (1979),Geometrische Modelle zur Analyse empirischer Daten, Berlin: Akademie Verlag.
HEISER, W. J. (1981),Unfolding Analysis of Proximity Data, Unpublished Doctoral Dissertation, University of Leiden.
HUBERT, L., and ARABIE, P. (1986), “Unidimensional Scaling and Combinatorial Optimization,” inMultidimensional Data Analysis, eds. J. de Leeuw, et al, Leiden: DSWO-Press, 181–196.
KRUSKAL, J. B. (1964a), “Multidimensional Scaling by Optimizing Goodness of Fit to a Nonmetric Hypotheses,”Psychometrika, 29, 1–28.
KRUSKAL, J. B. (1964b), “Nonmetric Multidimensional Scaling: A Numerical Method,”Psychometrika, 29, 115–129.
KRUSKAL, J. B. (1971), “Monotone Regression: Continuity and Differentiability Properties,”Psychometrika, 36, 57–62.
KRUSKAL, J. B., and WISH, M. (1978),Multidimensional Scaling, Newbury Park, CA: Sage.
LINGOES, J. C., and ROSKAM, E. E. (1973), “A Mathematical and Empirical Comparison of Two Multidimensional Scaling Algorithms,”Psychometrika, 38, Monograph Supplement.
ORTEGA, J. M., and RHEINBOLDT, W. C. (1970),Iterative Solution of Nonlinear Equations in Several Variables, New York: Academic Press.
OSTROWSKI, A. M. (1966),Solution of Equations and Systems of Equations, New York: Academic Press.
STOOP, I., and DE LEEUW, J. (1983),The Stepsize in Multidimensional Scaling Algorithms, Paper presented at the Third European Meeting of the Psychometric Society, Jouy-en-Josas, France, July 5–8, 1983.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
de Leeuw, J. Convergence of the majorization method for multidimensional scaling. Journal of Classification 5, 163–180 (1988). https://doi.org/10.1007/BF01897162
Issue Date:
DOI: https://doi.org/10.1007/BF01897162