The tunneling method for global optimization in multidimensional scaling
From MaRDI portal
Publication:676477
DOI10.1007/BF02294553zbMATH Open0866.92028OpenAlexW2073848658MaRDI QIDQ676477FDOQ676477
Authors: Patrick J. F. Groenen, Willem J. Heiser 
Publication date: 24 July 1997
Published in: Psychometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02294553
Recommendations
Cites Work
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- Title not available (Why is that?)
- On Nonlinear Fractional Programming
- Nonmetric multidimensional scaling. A numerical method
- Convergence of the majorization method for multidimensional scaling
- Title not available (Why is that?)
- The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
- A generalized majorization method for least squares multidimensional scaling of pseudodistances that may be negative
- Title not available (Why is that?)
- Title not available (Why is that?)
- Was Euclid an unnecessarily sophisticated psychologist?
- The majorization approach to multidimensional scaling for Minkowski distances
- Approximating a symmetric matrix
- A method of finding the global minimum of a function of one variable
- Title not available (Why is that?)
Cited In (18)
- Residual analysis for unidimensional scaling in the L2-norm
- Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
- Better initial configurations for metric multidimensional scaling
- Dyad ranking using Plackett-Luce models based on joint feature representations
- Parallel Global Optimization in Multidimensional Scaling
- Estimating the city-block two-dimensional scaling model with simulated annealing
- Title not available (Why is that?)
- Avoiding degeneracy in multidimensional unfolding by penalizing on the coefficient of variation
- From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
- Graphics processing units and high-dimensional optimization
- An exact algorithm for the two-mode \(KL\)-means partitioning problem
- Probabilistic multidimensional scaling using a city-block metric
- On the Bumpy Road to the Dominant Mode
- A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices
- Global optimization in least-squares multidimensional scaling by distance smoothing
- An improved exact algorithm for least-squares unidimensional scaling
- An interactive multiobjective programming approach to combinatorial data analysis
Uses Software
This page was built for publication: The tunneling method for global optimization in multidimensional scaling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676477)
