Preorderings, monotone functions, and best rank \(r\) approximations with applications to classical MDS

DOI10.1016/0378-3758(93)90108-IzbMath0808.62057OpenAlexW2048952150WikidataQ123417544 ScholiaQ123417544MaRDI QIDQ1329694

Rudolf Mathar, Renate Meyer

Publication date: 16 March 1995

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-3758(93)90108-i

zbMATH Keywords

principal component analysispreorderingmultidimensional scalingcone of positive semidefinite matricesclass of monotone functionslinear space of matricesrank \(r\) approximating matricessingular-value theoremuniversally optimal properties

Mathematics Subject Classification ID

Multivariate analysis (62H99) Factor analysis and principal components; correspondence analysis (62H25) Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) Multidimensional problems (41A63)

Related Items

Nonlinear eigenvector algorithms for local optimization in multivariate data analysis ⋮ Geometric buildup algorithms for sensor network localization

Cites Work

• Unnamed Item
• Unnamed Item
• The best Euclidean fit to a given distance matrix in prescribed dimensions
• The equivalence of two partial orders on a convex cone of positive semidefinite matrices
• On the Löwner, minus, and star partial orderings of nonnegative definite matrices and their squares
• G-majorization with applications to matrix orderings
• Information Increasing Orderings in Experimental Design Theory
• SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
• Convex Analysis
• Maximum Properties and Inequalities for the Eigenvalues of Completely Continuous Operators
• Inequalities: theory of majorization and its applications