Convergence of the majorization method for multidimensional scaling
From MaRDI portal
Publication:583775
DOI10.1007/BF01897162zbMath0692.62056OpenAlexW2077139171WikidataQ56428729 ScholiaQ56428729MaRDI QIDQ583775
Publication date: 1988
Published in: Journal of Classification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01897162
global convergencelocal minimaconvergence propertiesspeed of convergencemajorization methodGuttman transformmultidimensional scaling algorithmsnonmetric scalingstep-size techniques
Related Items
Setting up alternating least squares and iterative majorization algorithms for solving various matrix optimization problems ⋮ Estimating the city-block two-dimensional scaling model with simulated annealing ⋮ Points of view analysis revisited: Fitting multidimensional structures to optimal distance components with cluster restrictions on the variables ⋮ Weighted Euclidean biplots ⋮ OVERALS: Nonlinear canonical correlation with \(k\) sets of variables ⋮ A latent class unfolding model for analyzing single stimulus preference ratings ⋮ The cone of distance matrices ⋮ A new efficient algorithm based on DC programming and DCA for clustering ⋮ The majorization approach to multidimensional scaling for Minkowski distances ⋮ Visualizing the effects of a changing distance on data using continuous embeddings ⋮ Nonlinear eigenvector algorithms for local optimization in multivariate data analysis ⋮ Nonlinear dimensionality reduction by topologically constrained isometric embedding ⋮ Iterative denoising ⋮ A fast successive over-relaxation algorithm for force-directed network graph drawing ⋮ A majorized penalty approach to inverse linear second order cone programming problems ⋮ Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures ⋮ Data-driven graph drawing techniques with applications for conveyor systems ⋮ The tunneling method for global optimization in multidimensional scaling ⋮ A distance-based variety of nonlinear multivariate data analysis, including weights for objects and variables ⋮ INDSCAL model: geometrical interpretation and methodology ⋮ Resistant orthogonal Procrustes analysis ⋮ A uniform approach to multidimensional scaling ⋮ Fuzzy clustering with squared Minkowski distances ⋮ Analysis of asymmetry by a slide-vector ⋮ Positive semidefinite relaxations for distance geometry problems. ⋮ Analysis of \(k\) sets of data, with differential emphasis on agreement between and within sets ⋮ A generalized majorization method for least squares multidimensional scaling of pseudodistances that may be negative ⋮ Majorization as a tool for optimizing a class of matrix functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds for Kruskal's stress
- A general nonmetric technique for finding the smallest coordinate space for a configuration of points
- Monotone regression: Continuity and differentiability properties
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- Nonmetric multidimensional scaling. A numerical method