On Multidimensional Scaling with City-Block Distances
Multidimensional scaling is a technique for exploratory analysis of multidimensional data. The essential part of the technique is minimization of a function with unfavorable properties like multimodality, non-differentiability, and invariability with respect to some transformations. Recently various two-level optimization algorithms for multidimensional scaling with city-block distances have been proposed exploiting piecewise quadratic structure of the least squares objective function with such distances. A problem of combinatorial optimization is tackled at the upper level, and convex quadratic programming problems are tackled at the lower level. In this paper we discuss a new reformulation of the problem where lower level quadratic programming problems seem more suited for two-level optimization.
KeywordsMultidimensional scaling City-block distances Multilevel optimization Global optimization
This research was funded by a grant (No. MIP-063/2012) from the Research Council of Lithuania.
- 2.Borg, I., Groenen, P.J.F.: Modern Multidimensional Scaling: Theory and Applications, 2nd edn. Springer, New York (2005)Google Scholar
- 11.Žilinskas, J.: Reducing of search space of multidimensional scaling problems with data exposing symmetries. Inf. Technol. Control 36(4), 377–382 (2007)Google Scholar