Algorithms in convex analysis to fit \(\ell_ p\)-distance matrices

DOI10.1006/jmva.1994.1052zbMath0806.62051OpenAlexW1998078274WikidataQ123417543 ScholiaQ123417543MaRDI QIDQ1340283

Rudolf 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

global convergenceinverse iterationfinite dimensional Hilbert spacesubgradientsmultidimensional scalingdissimilarity matrixnonlinear eigenproblemlocal maximumconstrained 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)

Related Items

Nonlinear eigenvector algorithms for local optimization in multivariate data analysis, On global optimization in two-dimensional scaling