Algorithms in convex analysis to fit _ p-distance matrices

DOI10.1006/JMVA.1994.1052MaRDI QIDQ1340283zbMATH OpenOpenAlexWikidataFDO

Authors R. Mathar, Renate Meyer

Publication date 16 February 1995

Published in Journal of Multivariate Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jmva.1994.1052

zbMATH Keywords

multidimensional scalingglobal convergenceinverse iterationsubgradientsdissimilarity matrixnonlinear eigenproblemlocal maximumfinite dimensional Hilbert spaceconstrained maximization of convex functionsnew iterative procedureweighted least squares loss function

Mathematics Subject Classification ID

Multivariate analysis (62H99) Convex programming (90C25) One- and multidimensional scaling in the social and behavioral sciences (91C15)

Recommendations

• scientific article; zbMATH DE number 756189
• Extensions of classical multidimensional scaling via variable reduction
• scientific article; zbMATH DE number 1187485
• scientific article; zbMATH DE number 1203381

Cited in

(4)

• On global optimization in two-dimensional scaling
• scientific article; zbMATH DE number 1187485 (Why is no real title available?)
• Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice
• Nonlinear eigenvector algorithms for local optimization in multivariate data analysis

This page was built for publication: Algorithms in convex analysis to fit \(\ell_ p\)-distance matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1340283)