Global optimization in least-squares multidimensional scaling by distance smoothing

DOI10.1007/s003579900055zbMath1006.91055OpenAlexW2010486434WikidataQ127807915 ScholiaQ127807915MaRDI QIDQ1963870

Patrick J. F. Groenen, Jacqueline J. Meulman, Willem J. Heiser

Publication date: 12 March 2003

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003579900055

zbMATH Keywords

global optimizationmajorizationmultidimensional scalingMinkowski distancedistance smoothingquadratic majorizing functions

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Numerical optimization and variational techniques (65K10) One- and multidimensional scaling in the social and behavioral sciences (91C15)

Related Items (8)

Residual analysis for unidimensional scaling in the L₂-norm ⋮ Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis ⋮ Parallel branch and bound for multidimensional scaling with city-block distances ⋮ Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming ⋮ Interpreting degenerate solutions in unfolding by use of the vector model and the compensatory distance model ⋮ A hybrid method for multidimensional scaling using city-block distances ⋮ I-scal: Multidimensional scaling of interval dissimilarities ⋮ Branch and bound algorithm for multidimensional scaling with city-block metric

This page was built for publication: Global optimization in least-squares multidimensional scaling by distance smoothing