On the performance of simulated annealing for large-scale L₂ unidimensional scaling
From MaRDI portal
Publication:265251
Recommendations
- A permutation-translation simulated annealing algorithm for \(L_{1}\) and \(L_{2}\) unidimensional scaling
- A simulated annealing heuristic for unidimensional and multidimensional (city-block) scaling of symmetric proximity matrices.
- Multidimensional scaling with constraints using simulated annealing
- Global optimization in any Minkowski metric: A permutation-translation simulated annealing algorithm for multidimensional scaling
- Estimating the city-block two-dimensional scaling model with simulated annealing
Cited in
(7)- A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis
- An improved exact algorithm for least-squares unidimensional scaling
- A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices
- Estimation of the parameters of the INDSCAL model using the simulated annealing model
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
- Residual analysis for unidimensional scaling in the L2-norm
- A permutation-translation simulated annealing algorithm for \(L_{1}\) and \(L_{2}\) unidimensional scaling
This page was built for publication: On the performance of simulated annealing for large-scale \(L_{2}\) unidimensional scaling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q265251)
